Generalized attack on ECDSA: known bits in arbitrary positions
From MaRDI portal
Publication:6063142
DOI10.1007/s10623-023-01269-7zbMath1526.94028OpenAlexW4385469356MaRDI QIDQ6063142
Jian Weng, Jinzheng Cao, Yanbin Pan, Qingfeng Cheng
Publication date: 7 November 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-023-01269-7
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The LLL algorithm. Survey and applications
- The insecurity of the elliptic curve digital signature algorithm with partially known nonces
- Factoring RSA moduli with primes sharing bits in the middle
- Shortest vector from lattice sieving: a few dimensions for free
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- Advanced lattice sieving on GPUs, with tensor cores
- LWE with side information: attacks and concrete security estimation
- The general sieve kernel and new records in lattice reduction
- Revisiting the expected cost of solving uSVP and applications to LWE
- Biased nonce sense: lattice attacks against weak ECDSA signatures in cryptocurrencies
- Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
- Practical, Predictable Lattice Basis Reduction
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- BKZ 2.0: Better Lattice Security Estimates
- Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
- Lattice-based Cryptography
- A Tale of Three Signatures: Practical Attack of ECDSA with wNAF
- Extended Hidden Number Problem and Its Cryptanalytic Applications
- Predicting Lattice Reduction
This page was built for publication: Generalized attack on ECDSA: known bits in arbitrary positions
