Abstract
In 1976 Diffie and Hellman [152] described the framework for public-key cryptography. It was not until 1978 that three designs for public-key cryptosystems were published. Rivest, Shamir, and Adleman [431] showed how the discrete logarithm and factorization problems could be used to construct a public-key cryptosystem. This is the well-known RSA cryptosystem. Merkle and Hellman [339] used the knapsack problem in their construction. McEliece [329] built a system based on error correcting codes. Later in 1985 ElGamal [163] designed a public-key cryptosystem using the discrete logarithm problem. Koblitz [283] and Miller [346] suggested the use of elliptic curves in the design of public-key cryptosystems. Nowadays, there are quite a few more suggestions as to how to design public-key cryptosystems, but none so popular as the RSA and ElGamal cryptosystems.
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
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pieprzyk, J., Hardjono, T., Seberry, J. (2003). Public-Key Cryptosystems. In: Fundamentals of Computer Security. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-07324-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-07324-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07713-5
Online ISBN: 978-3-662-07324-7
eBook Packages: Springer Book Archive