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