Computation of a 30750-bit binary field discrete logarithm
From MaRDI portal
Publication:4956935
DOI10.1090/mcom/3669zbMath1472.11319arXiv2008.02717OpenAlexW3165713929MaRDI QIDQ4956935
Robert Granger, Jens Zumbrägel, Arjen K. Lenstra, Thorsten Kleinjung, Benjamin Wesolowski
Publication date: 2 September 2021
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.02717
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- On \(x^{q+1}+ax+b\)
- Modifications to the number field sieve
- The Magma algebra system. I: The user language
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- A general framework for subexponential discrete logarithm algorithms
- Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
- On the Function Field Sieve and the Impact of Higher Splitting Probabilities
- Breaking ‘128-bit Secure’ Supersingular Binary Curves
- Mersenne Factorization Factory
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
- Solving a $$6120$$ -bit DLP on a Desktop Computer
- A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
- Fast evaluation of logarithms in fields of characteristic two
- Finding Isomorphisms Between Finite Fields
- Factorization of a 768-Bit RSA Modulus
- On the discrete logarithm problem in finite fields of fixed characteristic
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Computation of a 768-Bit Prime Field Discrete Logarithm
This page was built for publication: Computation of a 30750-bit binary field discrete logarithm
