Public Key Cryptosystems

Multivariate public key cryptosystems (MPKC) is a fast-developing new area in cryptography. In the past 10 years, MPKC schemes have increasingly been seen as a possible alternative to number theoretic-based cryptosystems such as RSA, as they are generally more efficient in terms of computational effort. As quantum computers are developed, MPKC will become a necessary alternative.

Understand Public Key Infrastructure (PKI), OpenSSL, CSR, Certificates, Public Key Cryptosystems (RSA and ECC) in Java

Complete coverage of the current major public key cryptosystems their underlying mathematics and the most common techniques used in attacking them Public Key Cryptography: Applications and Attacks introduces and explains the fundamentals of public key cryptography and explores its application in all major public key cryptosystems in current use, including ElGamal, RSA, Elliptic Curve, and digital signature schemes. It provides the underlying mathematics needed to build and study these schemes as needed, and examines attacks on said schemes via the mathematical problems on which they are based – such as the discrete logarithm problem and the difficulty of factoring integers.

The cryptosystems based on the Integer Factorization Problem (IFP), the Discrete Logarithm Problem (DLP) and the Elliptic Curve Discrete Logarithm Problem (ECDLP) are essentially the only three types of practical public-key cryptosystems in use. The security of these cryptosystems relies heavily on these three infeasible problems, as no polynomial-time algorithms exist for them so far. However, polynomial-time quantum algorithms for IFP, DLP and ECDLP do exist, provided that a practical quantum computer exists.