- Josef PieprzykAffiliated withDepartment of Computing, Macquarie University
- , Thomas HardjonoAffiliated withVeriSign INC.
- , Jennifer SeberryAffiliated withSchool of Information Technology and Computer Science, University of Wollongong
In 1976 Diffie and Hellman  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  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  used the knapsack problem in their construction. McEliece  built a system based on error correcting codes. Later in 1985 ElGamal  designed a public-key cryptosystem using the discrete logarithm problem. Koblitz  and Miller  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.
- Public-Key Cryptosystems
- Book Title
- Fundamentals of Computer Security
- pp 171-218
- Print ISBN
- Online ISBN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
- Author Affiliations
- 4. Department of Computing, Macquarie University, Sydney, NSW, 2109, Australia
- 5. VeriSign INC., 401 Edgewater Place, Suite 280, Wakefield, MA, 01880, USA
- 6. School of Information Technology and Computer Science, University of Wollongong, Wollongong, NSW, 2522, Australia
To view the rest of this content please follow the download PDF link above.