scientific article; zbMATH DE number 1302865

zbMath0945.11026MaRDI QIDQ4249351

Thomas F. Denny, Damian Weber

Publication date: 5 October 2000

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

zbMATH Keywords

cryptographynumber field sievediscrete logarithmsDiffie-Hellman key exchange

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items

Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method ⋮ Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation ⋮ Finite field arithmetic in large characteristic for classical and post-quantum cryptography ⋮ Discrete logarithm problem using index calculus method ⋮ On the cubic sieve method for computing discrete logarithms over prime fields ⋮ Special prime numbers and discrete logs in finite prime fields ⋮ Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm ⋮ Using number fields to compute logarithms in finite fields

Uses Software

• LiDIA