A tale of three signatures: practical attack of ECDSA with wNAF
From MaRDI portal
(Redirected from Publication:5048983)
Recommendations
Cites work
- ``Ooh aah\(\ldots \)Just a little bit : a small amount of side channel can go a long way
- A hierarchy of polynomial time lattice basis reduction algorithms
- A Survey of Fast Exponentiation Methods
- Algorithmic Number Theory
- BKZ
- BKZ 2.0: Better lattice security estimates
- Block Reduced Lattice Bases and Successive Minima
- DSA signing key recovery with noisy side channels and variable error rates
- Extended Hidden Number Problem and Its Cryptanalytic Applications
- Factoring polynomials with rational coefficients
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- Just a Little Bit More
- Lattice attacks on digital signature schemes
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- The insecurity of the elliptic curve digital signature algorithm with partially known nonces
- Topics in Cryptology – CT-RSA 2006
Cited in
(13)- Lattice attacks against elliptic-curve signatures with blinded scalar multiplication
- Attacking ECDSA leaking discrete bits with a more efficient lattice
- Side-channel analysis of Weierstrass and Koblitz curve ECDSA on Android smartphones
- Two lattice-based differential fault attacks against ECDSA with wNAF algorithm
- scientific article; zbMATH DE number 1848387 (Why is no real title available?)
- Evaluating the cache side channel attacks against ECDSA
- Online template attack on ECDSA: extracting keys via the other side
- ``Ooh aah\(\ldots \)Just a little bit : a small amount of side channel can go a long way
- Generalized attack on ECDSA: known bits in arbitrary positions
- EHNP strikes back: analyzing SM2 implementations
- Handle the traces: revisiting the attack on ECDSA with EHNP
- Survey: recovering cryptographic keys from partial information, by example
- Formalizing the hidden number problem in Isabelle/HOL
This page was built for publication: A tale of three signatures: practical attack of ECDSA with wNAF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048983)