The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces

@article{Nguyen2003TheIO,
  title={The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces},
  author={Phong Q. Nguyen and Igor E. Shparlinski},
  journal={Des. Codes Cryptography},
  year={2003},
  volume={30},
  pages={201-217}
}
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer’s secret DSA key when a few bits of the random nonces k (used at each signature generation) are known for a number of DSA signatures at most linear in log q (q denoting as usual the small prime of DSA), under a reasonable assumption on the hash function… CONTINUE READING

Topics

Statistics

01020'02'04'06'08'10'12'14'16'18
Citations per Year

143 Citations

Semantic Scholar estimates that this publication has 143 citations based on the available data.

See our FAQ for additional information.