Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms

DOI10.1007/978-3-662-45611-8_20MaRDI QIDQ2938855zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 177888
• Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
• A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
• Cryptography and Coding
• scientific article; zbMATH DE number 1210375
• Faster individual discrete logarithms in finite fields of composite extension degree
• scientific article; zbMATH DE number 2127885
• Lower bounds on the linear complexity of the discrete logarithm in finite fields
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields

Cited in

(18)

• Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
• Factor base discrete logarithms in Kummer extensions
• Indiscreet logarithms in finite fields of small characteristic
• Updating key size estimations for pairings
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
• Faster initial splitting for small characteristic composite extension degree fields
• Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
• Faster individual discrete logarithms in finite fields of composite extension degree
• Computation of a 30750-bit binary field discrete logarithm
• 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
• Computation of a 768-bit prime field discrete logarithm
• Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
• Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms
• MPC in the head using the subfield bilinear collision problem
• A provably quasi-polynomial algorithm for the discrete logarithm problem in finite fields of small characteristic
• Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938855)