A probabilistic analysis on a lattice attack against DSA
From MaRDI portal
Publication:2329391
DOI10.1007/s10623-019-00633-wzbMath1447.94039arXiv1712.09829OpenAlexW2963560861WikidataQ128087112 ScholiaQ128087112MaRDI QIDQ2329391
Guénaël Renault, Ana I. Gómez, Domingo Gómez-Pérez
Publication date: 17 October 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.09829
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06) Exponential sums (11T23)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the discrete logarithm problem in elliptic curves. II
- Sequences, discrepancies and applications
- Recent progress on the elliptic curve discrete logarithm problem
- The LLL algorithm. Survey and applications
- Factoring polynomials with rational coefficients
- The insecurity of the elliptic curve digital signature algorithm with partially known nonces
- The insecurity of the digital signature algorithm with partially known nonces
- Subgroups generated by rational functions in finite fields
- Further results on implicit factoring in polynomial time
- Just a Little Bit More
- On the Function Field Sieve and the Impact of Higher Splitting Probabilities
- RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis
- Solving a $$6120$$ -bit DLP on a Desktop Computer
- Sums and products of sets and estimates of rational trigonometric sums in fields of prime order
- Structure computation and discrete logarithms in finite abelian $p$-groups
- Exponential Sums and Goppa Codes: I
- Attacking (EC)DSA Given Only an Implicit Hint
- Implicit Factoring with Shared Most Significant and Middle Bits
- Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
- Efficient Factoring Based on Partial Information
- Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Lattice attacks on digital signature schemes
This page was built for publication: A probabilistic analysis on a lattice attack against DSA
