@inproceedings{0a03a526c36d4d99b6d1d6b4a9944210,
title = "The insecurity of nyberg–rueppel and other DSA-like signature schemes with partially known nonces",
abstract = "It has recently been proved by Nguyen and Shparlinski that the Digital Signature Algorithm (DSA) is insecure when a few consecutive bits of the random nonces k are known for a reasonably small number of DSA signatures. This result confirmed the efficiency of some heuristic lattice attacks designed and numerically verified by Howgrave-Graham and Smart. Here, we extend the attack to the Nyberg–Rueppel variants of DSA.We use a connection with the hidden number problem introduced by Boneh and Venkatesan and new bounds of exponential sums which might be of independent interest.",
keywords = "Closest vector problem, DSA, Exponential sums, Hidden number problem",
author = "Mahassni, {Edwin El} and Nguyen, {Phong Q.} and Shparlinski, {Igor E.}",
year = "2001",
month = mar,
doi = "10.1007/3-540-44670-2_9",
language = "English",
isbn = "3540424881",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "97--109",
editor = "Silverman, {Joseph H.}",
booktitle = "Cryptography and Lattices",
address = "United States",
note = "International Conference on Cryptography and Lattices, CaLC - 2001 ; Conference date: 29-03-2001 Through 30-03-2001",
}