Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Cryptography (3)
- Asymmetric Cryptography (1)
- Class Number Problem (1)
- Coding theory (1)
- Cryptosystem (1)
-
- Diffie-Hellman (1)
- Discrete Logarithm (1)
- Elliptic Curve Cryptography (1)
- Factorization (1)
- Gauss (1)
- Grover's Algorithm (1)
- Hasse-Minkowski (1)
- Integer Factorization (1)
- Local-global principle (1)
- NTRU (1)
- P-adic numbers (1)
- Post-quantum (1)
- Proof (1)
- Quadratic Fields (1)
- Quantum Algorithm (1)
- Quantum Computing (1)
- Quantum Cryptography (1)
- Qubit (1)
- RSA (1)
- Selmer (1)
- Shor's Algorithm (1)
- Supersingular Isogeny (1)
- Unique Factorization (1)
Articles 1 - 5 of 5
Full-Text Articles in Number Theory
Unique Factorization In The Rings Of Integers Of Quadratic Fields: A Method Of Proof, Zachary Warren
Unique Factorization In The Rings Of Integers Of Quadratic Fields: A Method Of Proof, Zachary Warren
Senior Honors Theses
It is a well-known property of the integers, that given any nonzero a ∈ Z, where a is not a unit, we are able to write a as a unique product of prime numbers. This is because the Fundamental Theorem of Arithmetic (FTA) holds in the integers and guarantees (1) that such a factorization exists, and (2) that it is unique. As we look at other domains, however, specifically those of the form O(√D) = {a + b√D | a, b ∈ Z, D a negative, squarefree integer}, we find that …
A Comparison Of Cryptographic Methods, Christopher Gilmore
A Comparison Of Cryptographic Methods, Christopher Gilmore
Senior Honors Theses
While elliptic curve cryptography and quantum cryptography are significantly different branches of cryptography, they provide a suitable reference point for comparison of the value of developing methods used in the present and investing in methods to be used in the future. Elliptic curve cryptography is quite common today, as it is generally secure and efficient. However, as the field of cryptography advances, the value of quantum cryptography’s inherent security from its basic properties should be considered, as a fully realized quantum cryptosystem has the potential to be quite powerful. Ultimately, it is of critical importance to determine the value of …
Local-Global Principles For Diophantine Equations, Benjamin Barham
Local-Global Principles For Diophantine Equations, Benjamin Barham
Senior Honors Theses
The real number field, denoted ℝ, is the most well-known extension field of ℚ, the field of rational numbers, but it is not the only one. For each prime p, there exists an extension field ℚp of ℚ, and these fields, known as the p-adic fields, have some properties substantially different from ℝ. In this paper, we construct the p-adic numbers from the ground up and discuss the local-global principle, which concerns connections between solutions of equations found in ℚ and in ℚp. We state the Hasse-Minkowski theorem, which addresses a type …
Codes, Cryptography, And The Mceliece Cryptosystem, Bethany Matsick
Codes, Cryptography, And The Mceliece Cryptosystem, Bethany Matsick
Senior Honors Theses
Over the past several decades, technology has continued to develop at an incredible rate, and the importance of properly securing information has increased significantly. While a variety of encryption schemes currently exist for this purpose, a number of them rely on problems, such as integer factorization, that are not resistant to quantum algorithms. With the reality of quantum computers approaching, it is critical that a quantum-resistant method of protecting information is found. After developing the proper background, we evaluate the potential of the McEliece cryptosystem for use in the post-quantum era by examining families of algebraic geometry codes that allow …
Quantum Attacks On Modern Cryptography And Post-Quantum Cryptosystems, Zachary Marron
Quantum Attacks On Modern Cryptography And Post-Quantum Cryptosystems, Zachary Marron
Senior Honors Theses
Cryptography is a critical technology in the modern computing industry, but the security of many cryptosystems relies on the difficulty of mathematical problems such as integer factorization and discrete logarithms. Large quantum computers can solve these problems efficiently, enabling the effective cryptanalysis of many common cryptosystems using such algorithms as Shor’s and Grover’s. If data integrity and security are to be preserved in the future, the algorithms that are vulnerable to quantum cryptanalytic techniques must be phased out in favor of quantum-proof cryptosystems. While quantum computer technology is still developing and is not yet capable of breaking commercial encryption, these …