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

DOI10.1007/978-3-030-56880-1_2zbMath1504.94131OpenAlexW3035895299MaRDI QIDQ2096515

Cécile Pierrot, Pierrick Gaudry, Gabrielle De Micheli

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)

Related Items (3)

New discrete logarithm computation for the medium prime case using the function field sieve ⋮ A survey of elliptic curves for proof systems ⋮ Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds for resultants of univariate and bivariate polynomials
• On a problem of Oppenheim concerning Factorisatio Numerorum
• Modifications to the number field sieve
• Indiscreet logarithms in finite fields of small characteristic
• A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
• A unified polynomial selection method for the (tower) number field sieve algorithm
• The Tower Number Field Sieve
• New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
• Breaking ‘128-bit Secure’ Supersingular Binary Curves
• The multiple number field sieve for medium- and high-characteristic finite fields
• Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
• A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm
• Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
• Fast evaluation of logarithms in fields of characteristic two
• The Function Field Sieve in the Medium Prime Case
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• An Identity-Based Signature from Gap Diffie-Hellman Groups
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• On asymptotic complexity of computing discrete logarithms over GF(p)
• Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
• Using number fields to compute logarithms in finite fields
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• Virtual logarithms
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• A Kilobit Hidden SNFS Discrete Logarithm Computation
• The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
• The Number Field Sieve in the Medium Prime Case
• Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic

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