scientific article; zbMATH DE number 708814

MaRDI QIDQ4318705zbMATH OpenFDO

Authors Daniel M. Gordon, Kevin S. McCurley

Publication date 30 May 1995

zbMATH Keywords

cryptographydiscrete logarithmsCoppersmith's algorithmsize of fields of characteristic two

Mathematics Subject Classification ID

Cryptography (94A60) Distributed algorithms (68W15) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 2081061
• Discrete logarithms in \(\mathrm{GF}(p)\)
• scientific article; zbMATH DE number 1676635
• scientific article; zbMATH DE number 3956969
• Computation of discrete logarithms in an arbitrary finite field

Cited in

(8)

• scientific article; zbMATH DE number 2081061 (Why is no real title available?)
• Using number fields to compute logarithms in finite fields
• Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
• scientific article; zbMATH DE number 7310208 (Why is no real title available?)
• Fast group operations on elliptic curves in Maple
• Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
• Indiscreet logarithms in finite fields of small characteristic
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4318705)