Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields

DOI10.1007/978-3-030-56880-1_2MaRDI QIDQ2096515zbMATH OpenOpenAlexFDO

Authors Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot

Publication date 9 November 2022

Full work available at URL https://doi.org/10.1007/978-3-030-56880-1_2

zbMATH Keywords

discrete logarithm problempairing-based cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
• The multiple number field sieve for medium- and high-characteristic finite fields
• Indiscreet logarithms in finite fields of small characteristic
• Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography

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 new index calculus algorithm with complexity L(1/4+o(1)) in small characteristic
• A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
• A unified polynomial selection method for the (tower) number field sieve algorithm
• An Identity-Based Signature from Gap Diffie-Hellman Groups
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
• Bounds for resultants of univariate and bivariate polynomials
• Breaking `128-bit secure' supersingular binary curves. (Or how to solve discrete logarithms in \({\mathbb F}_{2^{4 \cdot 1223}}\) and \({\mathbb F}_{2^{12 \cdot 367}}\))
• 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
• Fast evaluation of logarithms in fields of characteristic two
• Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields
• Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
• scientific article; zbMATH DE number 1186945 (Why is no real title available?)
• scientific article; zbMATH DE number 1244209 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• scientific article; zbMATH DE number 799769 (Why is no real title available?)
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
• Indiscreet logarithms in finite fields of small characteristic
• 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)
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• The Function Field Sieve in the Medium Prime Case
• The multiple number field sieve for medium- and high-characteristic finite fields
• The Number Field Sieve in the Medium Prime Case
• The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
• The tower number field sieve
• Using number fields to compute logarithms in finite fields
• Virtual logarithms

Cited in

(14)

• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
• New discrete logarithm computation for the medium prime case using the function field sieve
• Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• scientific article; zbMATH DE number 2127885 (Why is no real title available?)
• О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом
• Parameterized Splitting Systems for the Discrete Logarithm
• Cryptography and Coding
• A survey of elliptic curves for proof systems
• A new perspective on the powers of two descent for discrete logarithms in finite fields
• On the complexity formulae of the number field sieve and its variants
• Utilizing two subfields to accelerate individual logarithm computation in extended tower number field sieve
• On the alpha value of polynomials in the tower number field sieve algorithm

This page was built for publication: Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields

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