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 used in DSA. The number of required bits is about log q, and can be further decreased to 2 if one assumes access to ideal lattice basis… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 83 CITATIONS, ESTIMATED 38% COVERAGE

83 Citations

05'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 83 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…