Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Cryptography (2)
- Algebra (1)
- Class Number Problem (1)
- Coding theory (1)
- Cryptosystem (1)
-
- Differential Equations (1)
- Differential Forms (1)
- Evariste Galois (1)
- Factorization (1)
- Field Extensions (1)
- Fields (1)
- Gauss (1)
- Group (1)
- Groups (1)
- Lie Derivative (1)
- Lie Groups (1)
- Mathematics (1)
- McEliece (1)
- ODE (1)
- Ordinary (1)
- Ordinary Differential Equations (1)
- Post-Quantum (1)
- Post-quantum (1)
- Proof (1)
- Quadratic Fields (1)
- Quantum (1)
- Symmetry (1)
- Unique Factorization (1)
Articles 1 - 5 of 5
Full-Text Articles in Physical Sciences and Mathematics
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 …
The Mceliece Cryptosystem As A Solution To The Post-Quantum Cryptographic Problem, Isaac Hanna
The Mceliece Cryptosystem As A Solution To The Post-Quantum Cryptographic Problem, Isaac Hanna
Senior Honors Theses
The ability to communicate securely across the internet is owing to the security of the RSA cryptosystem, among others. This cryptosystem relies on the difficulty of integer factorization to provide secure communication. Peter Shor’s quantum integer factorization algorithm threatens to upend this. A special case of the hidden subgroup problem, the algorithm provides an exponential speedup in the integer factorization problem, destroying RSA’s security. Robert McEliece’s cryptosystem has been proposed as an alternative. Based upon binary Goppa codes instead of integer factorization, his cryptosystem uses code scrambling and error introduction to hinder decrypting a message without the private key. This …
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 …
Solving Ordinary Differential Equations Using Differential Forms And Lie Groups, Richard M. Shumate
Solving Ordinary Differential Equations Using Differential Forms And Lie Groups, Richard M. Shumate
Senior Honors Theses
Differential equations have bearing on practically every scientific field. Though they are prevalent in nature, they can be challenging to solve. Most of the work done in differential equations is dependent on the use of many methods to solve particular types of equations. Sophus Lie proposed a modern method of solving ordinary differential equations in the 19th century along with a coordinate free variation of finding the infinitesimal generator by combining the influential work of Élie Cartan among others in the field of differential geometry. The driving idea behind using symmetries to solve differential equations is that there exists a …
The Life Of Evariste Galois And His Theory Of Field Extension, Felicia N. Adams
The Life Of Evariste Galois And His Theory Of Field Extension, Felicia N. Adams
Senior Honors Theses
Evariste Galois made many important mathematical discoveries in his short lifetime, yet perhaps the most important are his studies in the realm of field extensions. Through his discoveries in field extensions, Galois determined the solvability of polynomials. Namely, given a polynomial P with coefficients is in the field F and such that the equation P(x) = 0 has no solution, one can extend F into a field L with α in L, such that P(α) = 0. Whereas Galois Theory has numerous practical applications, this thesis will conclude with the examination and proof of the fact that it is impossible …