The Elliptic Curve Discrete Logarithm Problem: State of the Art


Two public-key families emerged that were commercially viable: 1. RSA (based on integer factorization) 2. Diffie-Hellman/ElGamal (based on the finite field discrete logarithm problem) – 2 RSA Invented by Rivest, Shamir and Adleman in 1977. Security is based on the hardness of the problem of factoring an integer n that is the product of two primes p and q of… (More)
DOI: 10.1007/978-3-540-89598-5_14


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics