Dual Lattice Attacks for Bounded Distance Decoding, Revisited

Analyses of dual lattice attacks have often assumed that the individual scores associated with short dual vectors are mutually independent. Laarhoven-Walter used this heuristic to derive explicit trade-offs between the target radius and query time for bounded distance decoding BDD with...

DSA Nonce Vulnerabilities: An Interactive Analysis

Digital signatures are fundamental to identity authentication and data integrity in cybersecurity, and the NIST-standardized Digital Signature Algorithm DSA frequently appears in the cryptography track of CTF competitions. However, DSA relies on number theory, modular arithmetic, and large-intege...

CVE-2024-1544

Generating the ECDSA nonce k samples a random number r and then truncates this randomness with a modular reduction mod n where n is the order of the elliptic curve. Meaning k = r mod n. The division used during the reduction estimates a factor qe by dividing the upper two digits a digit having e....