Sciweavers

CRYPTO
1992
Springer
154views Cryptology» more  CRYPTO 1992»
13 years 9 months ago
Massively Parallel Computation of Discrete Logarithms
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt ...
Daniel M. Gordon, Kevin S. McCurley