Discrete logarithm factory

DOI10.62056/AH2IP2FGXMaRDI QIDQ7326393zbMATH OpenFDO

Authors Haetham Al Aswad, Emmanuel Thomé, Cécile Pierrot

Publication date 9 September 2026

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/AH2IP2FGX

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Cites work

• A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm
• A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
• A Kilobit Hidden SNFS Discrete Logarithm Computation
• A unified polynomial selection method for the (tower) number field sieve algorithm
• An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^n)\)
• Batch NFS
• Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• Extended tower number field sieve: a new complexity for the medium prime case
• Faster individual discrete logarithms in finite fields of composite extension degree
• scientific article; zbMATH DE number 3563269 (Why is no real title available?)
• scientific article; zbMATH DE number 475433 (Why is no real title available?)
• scientific article; zbMATH DE number 475434 (Why is no real title available?)
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• Individual discrete logarithm with sublattice reduction
• Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Mersenne factorization factory
• Modifications to the number field sieve
• New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields
• On a problem of Oppenheim concerning Factorisatio Numerorum
• On asymptotic complexity of computing discrete logarithms over GF(p)
• On the alpha value of polynomials in the tower number field sieve algorithm
• On the discrete logarithm problem in finite fields of fixed characteristic
• On the size of pairing-based non-interactive arguments
• Refined analysis of the asymptotic complexity of the number field sieve
• Selecting cryptographic key sizes
• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• The development of the number field sieve
• The multiple number field sieve for medium- and high-characteristic finite fields
• The multiple number field sieve with conjugation and generalized Joux-Lercier methods
• The Number Field Sieve in the Medium Prime Case
• The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$

This page was built for publication: Discrete logarithm factory

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