A public key cryptosystem and a signature scheme based on discrete logarithms
Citations
7,008 citations
Cites methods from "A public key cryptosystem and a sig..."
...Another famous technique, related to Die-Hellman-type schemes (El Gamal [ 7 ], DSA, McCurley [14], etc.) combines the homomorphic properties of the modular exponentiation and the intractability of extracting discrete logarithms over nite groups....
[...]
5,770 citations
5,378 citations
4,680 citations
3,150 citations
References
14,980 citations
"A public key cryptosystem and a sig..." refers background or methods in this paper
...N 1975, Diffie and Hellman [3] introduced the concept of public key cryptography....
[...]
...For more details refer to [3]....
[...]
...Section II shows a way to implement the public key distribution scheme introduced by Diffie and Hellman [3] to encrypt and decrypt messages....
[...]
14,659 citations
"A public key cryptosystem and a sig..." refers background or methods in this paper
...For example, the RivesShamirAdleman (RSA) system [9] depends on the difficulty of factoring large integers....
[...]
...Since then, several attempts have been made to find practical public key systems (see, for example, [6], [7], [9]) depending on the difficulty of solving some problems....
[...]
...Then the best known algorithm for both computing discrete logarithms and factoring integers (which is the function used in some of the existing systems such as the RSA system [9]) is given by (see [1], [5], [10]) ( ), ln exp m cm O (8)...
[...]
1,292 citations
1,120 citations
384 citations
"A public key cryptosystem and a sig..." refers background or methods in this paper
...69 for factoring integers (due to Schnorr and Lenstra [10]), as well as for discrete logarithms over GF(p) (see [5])....
[...]
...Then the best known algorithm for both computing discrete logarithms and factoring integers (which is the function used in some of the existing systems such as the RSA system [9]) is given by (see [1], [5], [10]) ( ), ln exp m cm O (8)...
[...]
...The public key system can be easily extended to any GF(p), but recent progress in computing discrete logarithms over GF(p) where m is large (see [2,5]) makes the key size required very large for the system to be secure....
[...]