On the Function Field Sieve and the Impact of Higher Splitting Probabilities
From MaRDI portal
Publication:2849389
DOI10.1007/978-3-642-40084-1_7zbMath1316.11114OpenAlexW61549430MaRDI QIDQ2849389
Gary McGuire, Faruk Göloğlu, Jens Zumbrägel, Robert Granger
Publication date: 17 September 2013
Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40084-1_7
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (31)
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 ⋮ Classification of fractional projective permutations over finite fields ⋮ Classifying and generating exact coset representatives of \(\operatorname{PGL}_2(\mathbb{F}_q)\) in \(\operatorname{PGL}_2(\mathbb{F}_{q^2})\) ⋮ New discrete logarithm computation for the medium prime case using the function field sieve ⋮ Factor base discrete logarithms in Kummer extensions ⋮ Generating sets for the multiplicative groups of algebras over finite fields and expander graphs ⋮ Self-pairings on supersingular elliptic curves with embedding degree \textit{three} ⋮ A characterization of the number of roots of linearized and projective polynomials in the field of coefficients ⋮ Index calculus in the trace zero variety ⋮ Difference sets and three-weight linear codes from trinomials ⋮ A new perspective on the powers of two descent for discrete logarithms in finite fields ⋮ Roots of certain polynomials over 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 ⋮ On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic ⋮ Complete solution over \(\mathbb{F}_{p^n}\) of the equation \(X^{p^k+1}+X+a=0\) ⋮ Solving \(X^{q+1}+X+a=0\) over finite fields ⋮ Public-key cryptosystem based on invariants of diagonalizable groups ⋮ Updating key size estimations for pairings ⋮ Almost perfect nonlinear trinomials and hexanomials ⋮ 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 ⋮ Faster initial splitting for small characteristic composite extension degree fields ⋮ A probabilistic analysis on a lattice attack against DSA ⋮ Point compression for the trace zero subgroup over a small degree extension field ⋮ Traps to the BGJT-algorithm for discrete logarithms
This page was built for publication: On the Function Field Sieve and the Impact of Higher Splitting Probabilities
