Algorithmica
Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
Algorithmic algebraic number theory
Algorithmic algebraic number theory
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Computation of discrete logarithms in prime fields
Designs, Codes and Cryptography
An interactive identification scheme based on discrete logarithms and factoring
Journal of Cryptology - Eurocrypt '90
Discrete logarithms in GF(P) using the number field sieve
SIAM Journal on Discrete Mathematics
Public-Key Cryptography State
Solving Large Sparse Linear Systems over Finite Fields
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Response to Comments of the NIST Proposed Digital Signature Standard
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Non-interactive public-key cryptography
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Design and Analysis of Fast Provably Secure Public-Key Cryptosystems Based on a Modular Squaring
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
A note on Girault's self-certified model
Information Processing Letters
Designs, Codes and Cryptography
Generating EIGamal signatures without knowing the secret key
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Hidden pairings and trapdoor DDH groups
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
| Hi-index | 0.00 |
Using a number field sieve, discrete logarithms modulo primes of special forms can be found faster than standard primes. This has raised concerns about trapdoors in discrete log cryptosystems, such as the Digital Signature Standard. Tins paper discusses the practical impact of these trapdoors, and how to avoid them.