Discrete Logarithms: The Past and the Future
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Polynomials over finite fields free from large and small degree irreducible factors
Journal of Algorithms - Analysis of algorithms
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
The function field sieve in the medium prime case
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Hi-index | 0.00 |