The curious case of the half-half Bitcoin ECDSA nonces
From MaRDI portal
Publication:6186354
DOI10.1007/978-3-031-37679-5_12MaRDI QIDQ6186354
Dylan Rowe, Nadia Heninger, Joachim Breitner
Publication date: 2 February 2024
Published in: Progress in Cryptology - AFRICACRYPT 2023 (Search for Journal in Brave)
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Mathematical economics (91B99) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- The insecurity of the elliptic curve digital signature algorithm with partially known nonces
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- Biased nonce sense: lattice attacks against weak ECDSA signatures in cryptocurrencies
- Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
- “Ooh Aah... Just a Little Bit” : A Small Amount of Side Channel Can Go a Long Way
- Lattice attacks on digital signature schemes
This page was built for publication: The curious case of the half-half Bitcoin ECDSA nonces
