Computation of discrete logarithms in prime fields

DOI10.1007/BF00123958zbMath0747.94012OpenAlexW1966677764MaRDI QIDQ1179517

B. A. LaMacchia, Andrew M. Odlyzko

Publication date: 26 June 1992

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00123958

zbMATH Keywords

cryptographydiscrete logarithm probleminteger factorizationattackdiscrete exponentiationidentification system

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Factorization; primality (11A51)

Related Items

Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method, Improved Sieving on Algebraic Curves, Discrete logarithm problem using index calculus method, Faster individual discrete logarithms in finite fields of composite extension degree, An interactive identification scheme based on discrete logarithms and factoring, An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic, Performance analysis of index calculus method, On the cubic sieve method for computing discrete logarithms over prime fields, Fast matrix decomposition in \(\mathbb F_2\), Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле, Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings, Public-key cryptography on smart cards

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete logarithms in \(\mathrm{GF}(p)\)
• An interactive identification scheme based on discrete logarithms and factoring
• Modifications to the number field sieve
• Fast evaluation of logarithms in fields of characteristic two
• Computing Logarithms in Finite Fields of Characteristic Two
• Modular Multiplication Without Trial Division
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• Elliptic Curve Cryptosystems
• New directions in cryptography
• Using encryption for authentication in large networks of computers
• Reducing elliptic curve logarithms to logarithms in a finite field
• Factoring with Two Large Primes
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve