scientific article; zbMATH DE number 1302865

MaRDI QIDQ4249351zbMATH OpenFDO

Authors Damian Weber, Thomas F. Denny

Publication date 5 October 2000

zbMATH Keywords

cryptographyDiffie-Hellman key exchangediscrete logarithmsnumber field sieve

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 691483
• The Number Field Sieve in the Medium Prime Case
• scientific article; zbMATH DE number 1303121

Cited in

(8)

• Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
• Special prime numbers and discrete logs in finite prime fields
• Discrete logarithm problem using index calculus method
• 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
• On the cubic sieve method for computing discrete logarithms over prime fields
• Finite field arithmetic in large characteristic for classical and post-quantum cryptography
• Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm

Describes a project that uses

Uses Software

• LiDIA

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 Q4249351)