Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields

DOI10.1007/978-3-642-38348-9_11zbMath1306.94063OpenAlexW2213167237MaRDI QIDQ4924410

Antoine Joux

Publication date: 31 May 2013

Published in: Advances in Cryptology – EUROCRYPT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38348-9_11

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (18)

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 ⋮ Index calculus in the trace zero variety ⋮ A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm ⋮ 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 ⋮ Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms ⋮ Updating key size estimations for pairings ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Fully Secure IBE with Tighter Reduction in Prime Order Bilinear Groups ⋮ Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming ⋮ A probabilistic analysis on a lattice attack against DSA ⋮ Selecting polynomials for the Function Field Sieve ⋮ Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields ⋮ A Brief History of Pairings ⋮ Traps to the BGJT-algorithm for discrete logarithms

This page was built for publication: Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields