On the security of the digital signature algorithm
The authors develop a new key-recovery attack against the Digital Signature Algorithm (DSA). It is a variant of known attacks by Boneh et al. and is also based on lattice basis reduction techniques. They prove that the system will be insecure if half of the total number of bits in the secret and ephemeral keys (or in two ephemeral keys) are known provided that the unknown bits are contiguous.
scientific article; zbMATH DE number 1785702