A Kilobit Hidden SNFS Discrete Logarithm Computation
From MaRDI portal
Publication:5738878
DOI10.1007/978-3-319-56620-7_8zbMath1411.11134arXiv1610.02874OpenAlexW3101100768MaRDI QIDQ5738878
Emmanuel Thomé, Nadia Heninger, Pierrick Gaudry, Joshua Fried
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.02874
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (10)
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation ⋮ Higher-dimensional sieving for the number field sieve algorithms ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ Subliminal Hash Channels ⋮ Computing discrete logarithms in \(\mathbb F_{p^6}\) ⋮ Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation ⋮ Updating key size estimations for pairings ⋮ Refined analysis to the extended tower number field sieve ⋮ Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields ⋮ Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The development of the number field sieve
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
- Modifications to the number field sieve
- An \(L(1/3)\) discrete logarithm algorithm for low degree curves
- Special prime numbers and discrete logs in finite prime fields
- Nearly sparse linear algebra and application to discrete logarithms computations
- The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone?
- Online order basis algorithm and its impact on the block Wiedemann algorithm
- Factorization of a 768-Bit RSA Modulus
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- Discrete logarithms and local units
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- On asymptotic complexity of computing discrete logarithms over GF(p)
- Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- A Kilobit Special Number Field Sieve Factorization
- Public Key Cryptography - PKC 2006
This page was built for publication: A Kilobit Hidden SNFS Discrete Logarithm Computation
