Number Theory in Public Key Cryptography

  • Alko R. Meijer
Part of the Springer Undergraduate Texts in Mathematics and Technology book series (SUMAT)


We have already dealt with two of the most important applications of number theory, namely the difficulty of factoring as used in the RSA public key system, and the difficulty of the discrete logarithm problem in Diffie–Hellman key establishment and ElGamal encryption. It is worthwhile recalling that until as recently as 1976, when Diffie and Hellman’s famous paper appeared, it was generally thought to be impossible to encrypt a message from Alice to Bob, if Alice and Bob had not previously obtained a secret key. Until then number theory was seen as the “Queen of Mathematics”, which is how Gauss described it, and as one would like a queen to be, this could (somewhat rudely) be construed as meaning “beautiful, but of no practical value”.


Access Structure Conjunctive Normal Form Disjunctive Normal Form Discrete Logarithm Problem Chinese Remainder Theorem 
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.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Alko R. Meijer
    • 1
  1. 1.Tokai, Cape TownSouth Africa

Personalised recommendations