Abstract
The security of public-key cryptosystems is based on the intractability of certain computational problems. The security of the RSA and Rabin schemes is based on the hardness of integer factorization. The security of the ElGamal protocols and of DSA is based on the intractability of computing discrete logarithms in finite prime fields. However, none of those computational problems is provably intractable. Algorithmic progress has almost always been faster than predicted and it is known that quantum computers will make integer factorization and discrete logarithm computation in the relevant groups easy. Therefore, it is necessary to find public-key cryptosystems that are based on new intractable problems. In particular, it is necessary to find public key cryptosystems that remain secure even when quantum computers can be built.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
© 2004 Springer Science+Business Media New York
About this chapter
Cite this chapter
Buchmann, J.A. (2004). Other Systems. In: Introduction to Cryptography. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-9003-7_13
Download citation
DOI: https://doi.org/10.1007/978-1-4419-9003-7_13
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-20756-8
Online ISBN: 978-1-4419-9003-7
eBook Packages: Springer Book Archive