scientific article; zbMATH DE number 708814

MaRDI QIDQ4318705zbMATH OpenFDO

Authors Daniel M. Gordon, Kevin S. McCurley

Publication date 30 May 1995

zbMATH Keywords

Coppersmith's algorithmcryptographydiscrete logarithmssize of fields of characteristic two

Mathematics Subject Classification ID

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

Recommendations

• Computation of discrete logarithms in \(\mathbb {F}_{2^{607}}\)
• Discrete logarithms in \(\mathrm{GF}(p)\)
• An implementation of the general number field sieve to compute discrete logarithms mod p
• scientific article; zbMATH DE number 3956969
• Computation of discrete logarithms in an arbitrary finite field

Cited in

(8)

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

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)