- Resource Types
- Resource Languages
- Institutional Repository
Keep Browsing
WHDL - 00011613
Visit the home page
About Site Language
WHDL is viewable in multiple languages. Use the pull-down menu to select a language to view the site.
I changed my language, but I’m still seeing resources in the other languages?
If a resource or text has not been translated into your selected language, it will appear in the initially added language. We are always looking for help translating these resources. If you can help, contact us!
Cover Image
Description / Abstract
This paper examines some of the complexities of the public key encryption system RSA. RSA provides the necessary steps to encrypt messages using modular arithmetic. It doesn’t require separate parties to exchange keys because the encrypting key is published for anyone to use. This creates a secure system whose strength lies in the difficulty to factor the product of two large (500-600 digits) prime numbers. RSA was originally written to be used over the ring of integers. This paper gives the necessary mathematical background needed to extend RSA to be used over the ring of polynomials using the quotient ring F2[x]/n(x).
Arete: The PLNU Honors Journal
Download this Resource
Download Free from WHDL
-
Download as a PDF
File Size Small - 316 KB
KeywordsArete the PLNU Honors Journal, encryption, RSA, public key
Degree AwardedBachelor of Science in Mathematics
Awarding InstitutionPoint Loma Nazarene University
Committee MembersCatherine Crockett, Benjamin Mood
Supervisor or ChairJesus Jimenez
Peer Reviewed?No
Collections With This Resource
PLNU Undergraduate Honors Projects 2016-2020
81 Resources
- English