Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Cryptography (2)
- Number theory (2)
- Induction (Mathematics) (1)
- Algebra (1)
- Algebraic integers (1)
-
- Asymmetric cryptosystem (1)
- Ciphers (1)
- Combinatorial analysis (1)
- Congruence (1)
- Congruent number (1)
- Congruent number problem (1)
- Elliptic curves (1)
- Embedding (1)
- Ergodic theory (1)
- Heights (1)
- Lattice Theory (1)
- Lattices (1)
- NP-completeness (1)
- Number fields (1)
- P-adic numbers (1)
- Polynomials (1)
- Prime set (1)
- Quadratic forms (1)
- Quantum Fourier Transform (1)
- RSA Encryption (1)
- Ring (1)
- Semigroups (1)
- Shor's Algorithm (1)
- Symbolic dynamics (1)
Articles 1 - 7 of 7
Full-Text Articles in Number Theory
Bridging Theory And Application: A Journey From Minkowski's Theorem To Ggh Cryptosystems In Lattice Theory, Danzhe Chen
Bridging Theory And Application: A Journey From Minkowski's Theorem To Ggh Cryptosystems In Lattice Theory, Danzhe Chen
CMC Senior Theses
This thesis provides a comprehensive exploration of lattice theory, emphasizing its dual significance in both theoretical mathematics and practical applications, particularly within computational complexity and cryptography. The study begins with an in-depth examination of the fundamental properties of lattices and progresses to intricate lattice-based problems such as the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP). These problems are analyzed for their computational depth and linked to the Subset Sum Problem (SSP) to highlight their critical roles in understanding computational hardness. The narrative then transitions to the practical applications of these theories in cryptography, evaluating the shift from …
Unveiling The Power Of Shor's Algorithm: Cryptography In A Post Quantum World, Dylan Phares
Unveiling The Power Of Shor's Algorithm: Cryptography In A Post Quantum World, Dylan Phares
CMC Senior Theses
Shor's Algorithm is an extremely powerful tool, in utilizing this tool it is important to understand how it works and why it works. As well as the vast implications it could have for cryptography
On Properties Of Positive Semigroups In Lattices And Totally Real Number Fields, Siki Wang
On Properties Of Positive Semigroups In Lattices And Totally Real Number Fields, Siki Wang
CMC Senior Theses
In this thesis, we give estimates on the successive minima of positive semigroups in lattices and ideals in totally real number fields. In Chapter 1 we give a brief overview of the thesis, while Chapters 2 – 4 provide expository material on some fundamental theorems about lattices, number fields and height functions, hence setting the necessary background for the original results presented in Chapter 5. The results in Chapter 5 can be summarized as follows. For a full-rank lattice L ⊂ Rd, we are concerned with the semigroup L+ ⊆ L, which denotes the set of all vectors with nonnegative …
On The Characterization Of Prime Sets Of Polynomials By Congruence Conditions, Arvind Suresh
On The Characterization Of Prime Sets Of Polynomials By Congruence Conditions, Arvind Suresh
CMC Senior Theses
This project is concerned with the set of primes modulo which some monic, irreducible polynomial over the integers has a root, called the Prime Set of the polynomial. We completely characterise these sets for degree 2 polynomials, and develop sufficient machinery from algebraic number theory to show that if the Galois group of a monic, irreducible polynomial over the integers is abelian, then its Prime Set can be written as the union of primes in some congruence classes modulo some integer.
Elliptic Curves And The Congruent Number Problem, Jonathan Star
Elliptic Curves And The Congruent Number Problem, Jonathan Star
CMC Senior Theses
In this paper we explain the congruent number problem and its connection to elliptic curves. We begin with a brief history of the problem and some early attempts to understand congruent numbers. We then introduce elliptic curves and many of their basic properties, as well as explain a few key theorems in the study of elliptic curves. Following this, we prove that determining whether or not a number n is congruent is equivalent to determining whether or not the algebraic rank of a corresponding elliptic curve En is 0. We then introduce L-functions and explain the Birch and …
Finding Zeros Of Rational Quadratic Forms, John F. Shaughnessy
Finding Zeros Of Rational Quadratic Forms, John F. Shaughnessy
CMC Senior Theses
In this thesis, we introduce the notion of quadratic forms and provide motivation for their study. We begin by discussing Diophantine equations, the field of p-adic numbers, and the Hasse-Minkowski Theorem that allows us to use p-adic analysis determine whether a quadratic form has a rational root. We then discuss search bounds and state Cassels' Theorem for small-height zeros of rational quadratic forms. We end with a proof of Cassels' Theorem and suggestions for further reading.
Ergodic And Combinatorial Proofs Of Van Der Waerden's Theorem, Matthew Samuel Rothlisberger
Ergodic And Combinatorial Proofs Of Van Der Waerden's Theorem, Matthew Samuel Rothlisberger
CMC Senior Theses
Followed two different proofs of van der Waerden's theorem. Found that the two proofs yield important information about arithmetic progressions and the theorem. van der Waerden's theorem explains the occurrence of arithmetic progressions which can be used to explain such things as the Bible Code.