Biased nonce sense: lattice attacks against weak ECDSA signatures in cryptocurrencies
From MaRDI portal
Publication:2656908
Recommendations
- The insecurity of the elliptic curve digital signature algorithm with partially known nonces
- scientific article; zbMATH DE number 1848387
- The insecurity of the digital signature algorithm with partially known nonces
- Attacking (EC)DSA given only an implicit hint
- GLV/GLS decomposition, power analysis, and attacks on ECDSA signatures with single-bit nonce bias
Cited in
(14)- The curious case of the half-half Bitcoin ECDSA nonces
- Isochronous Gaussian sampling: from inception to implementation
- Low error efficient computational extractors in the CRS model
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- Remote voting protocols. II
- Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith
- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures
- Attacking ECDSA leaking discrete bits with a more efficient lattice
- GLV/GLS decomposition, power analysis, and attacks on ECDSA signatures with single-bit nonce bias
- Handle the traces: revisiting the attack on ECDSA with EHNP
- Speed optimizations in bitcoin key recovery attacks
- Generalized attack on ECDSA: known bits in arbitrary positions
- All shall FA-LLL: breaking CT-RSA 2022 and CHES 2022 infective countermeasures with lattice-based fault attacks
- White-box ECDSA: challenges and existing solutions
This page was built for publication: Biased nonce sense: lattice attacks against weak ECDSA signatures in cryptocurrencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656908)
