A new index calculus algorithm with complexity L(1/4+o(1)) in small characteristic

DOI10.1007/978-3-662-43414-7_18MaRDI QIDQ2949540zbMATH OpenOpenAlexFDO

Authors Antoine Joux

Publication date 1 October 2015

Published in Selected Areas in Cryptography -- SAC 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-43414-7_18

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• 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
• A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
• Factor base discrete logarithms in Kummer extensions
• The multiple number field sieve for medium- and high-characteristic finite fields

Cited in

(33)

• Index calculus in the trace zero variety
• Effective compression maps for torus-based cryptography
• Computational Number Theory and Cryptography
• Computation of a 30750-bit binary field discrete logarithm
• Multilinear polynomial systems: root isolation and bit complexity
• Koblitz curves over quadratic fields
• Smoothness test for polynomials defined over small characteristic finite fields
• Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
• Choosing and generating parameters for pairing implementation on BN curves
• A new perspective on the powers of two descent for discrete logarithms in finite fields
• Post-quantum cryptography: state of the art
• Point compression for the trace zero subgroup over a small degree extension field
• On the discrete logarithm problem in finite fields of fixed characteristic
• Faster individual discrete logarithms in finite fields of composite extension degree
• Factor base discrete logarithms in Kummer extensions
• ON BOUNDS FOR BALANCED EMBEDDING DEGREE
• Classifying and generating exact coset representatives of \(\operatorname{PGL}_2(\mathbb{F}_q)\) in \(\operatorname{PGL}_2(\mathbb{F}_{q^2})\)
• Rigorous analysis of a randomised number field sieve
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
• A survey of fault attacks in pairing based cryptography
• On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic
• Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules
• Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
• Koszul-type determinantal formulas for families of mixed multilinear systems
• MPC in the head using the subfield bilinear collision problem
• Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography
• Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH
• Faster initial splitting for small characteristic composite extension degree fields
• A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm
• Indiscreet logarithms in finite fields of small characteristic
• Bit Security of the CDH Problems over Finite Fields
• Adaptively simulation-secure attribute-hiding predicate encryption
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields

This page was built for publication: A new index calculus algorithm with complexity \(L(1/4+o(1))\) in small characteristic

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