Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms

DOI10.1007/978-3-662-45611-8_20zbMath1306.94064OpenAlexW414359703MaRDI QIDQ2938855

Antoine Joux, Cécile Pierrot

Publication date: 16 January 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-45611-8_20

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (14)

Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields ⋮ Factor base discrete logarithms in Kummer extensions ⋮ Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression ⋮ Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms ⋮ Computation of a 768-Bit Prime Field Discrete Logarithm ⋮ Updating key size estimations for pairings ⋮ 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 ⋮ Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields ⋮ Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic

This page was built for publication: Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms