(EC)DSA lattice attacks based on Coppersmith's method
From MaRDI portal
Publication:280950
DOI10.1016/J.IPL.2016.04.001zbMATH Open1375.94122OpenAlexW2325654563MaRDI QIDQ280950FDOQ280950
Authors: Konstantinos A. Draziotis 
Publication date: 10 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2016.04.001
Recommendations
Cites Work
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Title not available (Why is that?)
- On the security of the digital signature algorithm
- A sieve algorithm based on overlattices
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- Title not available (Why is that?)
- Some lattice attacks on DSA and ECDSA
- Predicting Lattice Reduction
- Public Key Cryptography - PKC 2005
- Lattice attacks on digital signature schemes
Cited In (7)
- Some lattice attacks on DSA and ECDSA
- A tale of three signatures: practical attack of ECDSA with wNAF
- Attacking ECDSA leaking discrete bits with a more efficient lattice
- Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
- Attacking (EC)DSA with partially known multiples of nonces
- Attacking (EC)DSA scheme with ephemeral keys sharing specific bits
- On the one-per-message unforgeability of (EC)DSA and its variants
Uses Software
This page was built for publication: (EC)DSA lattice attacks based on Coppersmith's method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280950)
