Keywords
Discrete logarithmFinite fieldCryptosystemCryptographyPrime (order theory)LogarithmInteger (computer science)Prime numberPost-quantum cryptographyDiscrete mathematicsMathematicsField (mathematics)Computer scienceTheoretical computer scienceArithmeticAlgorithmPublic-key cryptographyCombinatoricsPure mathematicsEncryptionComputer security
Affiliated Institutions
Related Publications
A public key cryptosystem and a signature scheme based on discrete logarithms
A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem. The security of both s...
Computing Logarithms in Finite Fields of Characteristic Two
A simple algorithm to find logarithms in a finite field of characteristic two is described. It uses the Euclidean algorithm for polynomials in attempting to reduce an element to...
A subexponential-time algorithm for computing discrete logarithms overGF(p^2)
An algorithm for computing discrete logarithms over GF <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(p^{2})</tex> , where <tex ...
An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
A cryptographic system is described which is secure if and only if computing logarithms over <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1...
New algorithms for finding irreducible polynomials over finite fields
We present a new algorithm for finding an irreducible polynomial of specified degree over a finite field. Our algorithm is deterministic, and it runs in polynomial time for fiel...
Publication Info
- Year
- 2007
- Type
- book-chapter
- Pages
- 224-314
- Citations
- 365
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
365
OpenAlex
Cite This
Andrew Odlyzko
(2007).
Discrete logarithms in finite fields and their cryptographic significance.
Lecture notes in computer science
, 224-314.
https://doi.org/10.1007/3-540-39757-4_20
Identifiers
- DOI
- 10.1007/3-540-39757-4_20