Public-Key Cryptosystems

  • Josef Pieprzyk
  • Thomas Hardjono
  • Jennifer Seberry


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.


Elliptic Curve Elliptic Curf Random Oracle Discrete Logarithm Problem Message Space 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Josef Pieprzyk
    • 1
  • Thomas Hardjono
    • 2
  • Jennifer Seberry
    • 3
  1. 1.Department of ComputingMacquarie UniversitySydneyAustralia
  2. 2.VeriSign INC.WakefieldUSA
  3. 3.School of Information Technology and Computer ScienceUniversity of WollongongWollongongAustralia

Personalised recommendations