Publication Year

2009

Keywords

Fractions, CFRAC algorithm, continued fractions

Disciplines

Mathematics | National Security Law

Abstract

The goal of my project was to gain a better understanding of the CFRAC algorithm and to be able to share my knowledge of factorization of large numbers as it relates to the national security of our country. In order to complete my goal I conducted research of the field of mathematics with a specific exploration of the CFRAC algorithm. With RSA being publicly described in 1977, major breakthroughs were established in message encryption. My goal was to find out if it was possible to crack the RSA code through utilization of CFRAC. In order to do this, I needed to explore the special properties of finite and infinite continued fractions. I also needed to further my knowledge of the program Maple which enabled me to work through the CFRAC algorithm much more quickly.

Department 1 Awarding Honors Status

Mathematics

Creative Commons License

Creative Commons Attribution-Noncommercial 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial 4.0 License

Share

 
COinS