Abstract
The RSA algorithm was the world’s first public key encryption algorithm, and it has stood the test of time remarkably well. The RSA algorithm is based on the difficulty of the RSA problem considered in Chapter 2, and hence it is based on the difficulty of finding the prime factors of large integers. However, we have seen that it may be possible to solve the RSA problem without factoring, hence the RSA algorithm is not based completely on the difficulty of factoring.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Smart, N.P. (2016). The “Naive” RSA Algorithm. In: Cryptography Made Simple. Information Security and Cryptography. Springer, Cham. https://doi.org/10.1007/978-3-319-21936-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-21936-3_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21935-6
Online ISBN: 978-3-319-21936-3
eBook Packages: Computer ScienceComputer Science (R0)