New lattice attacks on DSA schemes
From MaRDI portal
Publication:293717
DOI10.1515/jmc-2014-0027zbMath1408.94960OpenAlexW2401500277MaRDI QIDQ293717
Publication date: 9 June 2016
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2014-0027
public key cryptographydiscrete logarithmclosest vector problemdigital signature algorithmelliptic curve digital signature algorithm
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some lattice attacks on DSA and ECDSA
- On the fly authentication and signature schemes based on groups of unknown order
- Factoring polynomials with rational coefficients
- The insecurity of the elliptic curve digital signature algorithm with partially known nonces
- On the security of the digital signature algorithm
- The insecurity of the digital signature algorithm with partially known nonces
- The state of elliptic curve cryptography
- Lattice Attacks on DSA Schemes Based on Lagrange’s Algorithm
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
- Modern Computer Arithmetic
- Attacking (EC)DSA Given Only an Implicit Hint
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A Survey of Public-Key Cryptosystems
- Lattice attacks on digital signature schemes
This page was built for publication: New lattice attacks on DSA schemes