scientific article; zbMATH DE number 708814

zbMath0813.94007MaRDI QIDQ4318705

Daniel M. Gordon, Kevin S. McCurley

Publication date: 30 May 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cryptographydiscrete logarithmsCoppersmith's algorithmsize of fields of characteristic two

Mathematics Subject Classification ID

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

Related Items (6)

Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method ⋮ Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity ⋮ Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Using number fields to compute logarithms in finite fields ⋮ Fast group operations on elliptic curves in Maple

This page was built for publication: