(EC)DSA lattice attacks based on Coppersmith's method
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1186945 (Why is no real title available?)
- scientific article; zbMATH DE number 1024052 (Why is no real title available?)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A sieve algorithm based on overlattices
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- Lattice attacks on digital signature schemes
- On the security of the digital signature algorithm
- Predicting Lattice Reduction
- Public Key Cryptography - PKC 2005
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Some lattice attacks on DSA and ECDSA
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
- On the one-per-message unforgeability of (EC)DSA and its variants
- Attacking (EC)DSA scheme with ephemeral keys sharing specific bits
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)