Rochester Institute of Technology
Applications of Continued Fractions in Cryptography and Diophantine Equations
Abstract
dc:description.abstractThe theory of continued fractions has applications in cryptographic problems and in solution methods for Diophantine equations. We will first examine the basic properties of continued fractions such as convergents and approximations to real numbers. Then we will discuss a computationally efficient attack on the RSA cryptosystem (Wiener's attack) based on continued fractions. Finally, using continued fractions and solutions of Pell's equation, we will show that the Diophantine equation x^4-kx^2y^2+y^4 = 2^j (k,j are natural numbers) has no nontrivial solutions for j=9,10,11 given that k > 2 and k is not a perfect square.
Degree
thesis:*- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- School of Mathematical Sciences (COS)
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Kaufer, Aaron H
- Contributors dc:contributor
-
- Anurag Agarwal
Subjects
dc:subject × 6Identifiers
dc:identifier.*- Repository record dc:identifier
- https://repository.rit.edu/theses/9085