A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
From MaRDI portal
Publication:2949540
DOI10.1007/978-3-662-43414-7_18zbMath1362.94034OpenAlexW88444553MaRDI QIDQ2949540
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
Related Items (32)
Effective compression maps for torus-based cryptography ⋮ Smoothness test for polynomials defined over small characteristic finite fields ⋮ Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields ⋮ Classifying and generating exact coset representatives of \(\operatorname{PGL}_2(\mathbb{F}_q)\) in \(\operatorname{PGL}_2(\mathbb{F}_{q^2})\) ⋮ Factor base discrete logarithms in Kummer extensions ⋮ Computational Number Theory and Cryptography ⋮ Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography ⋮ A survey of fault attacks in pairing based cryptography ⋮ Index calculus in the trace zero variety ⋮ A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm ⋮ A new perspective on the powers of two descent for discrete logarithms in finite fields ⋮ On the discrete logarithm problem in finite fields of fixed characteristic ⋮ Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity ⋮ Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH ⋮ Adaptively simulation-secure attribute-hiding predicate encryption ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic ⋮ ON BOUNDS FOR BALANCED EMBEDDING DEGREE ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems ⋮ Rigorous analysis of a randomised number field sieve ⋮ Multilinear polynomial systems: root isolation and bit complexity ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography ⋮ Computation of a 30750-bit binary field discrete logarithm ⋮ Post-Quantum Cryptography: State of the Art ⋮ Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules ⋮ Bit Security of the CDH Problems over Finite Fields ⋮ Faster initial splitting for small characteristic composite extension degree fields ⋮ Koblitz curves over quadratic fields ⋮ Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields ⋮ Point compression for the trace zero subgroup over a small degree extension field
This page was built for publication: A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
