Sciweavers

JOC
2002
99views more  JOC 2002»
13 years 3 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present 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 ...
Phong Q. Nguyen, Igor Shparlinski
JOC
2002
114views more  JOC 2002»
13 years 3 months ago
Improving the Exact Security of Digital Signature Schemes
We put forward a new method of constructing Fiat-Shamir-like signature schemes that yields better "exact security" than the original Fiat-Shamir method. (We also point o...
Silvio Micali, Leonid Reyzin
JOC
2002
46views more  JOC 2002»
13 years 3 months ago
Constructive and Destructive Facets of Weil Descent on Elliptic Curves
Pierrick Gaudry, Florian Hess, Nigel P. Smart
JOC
2002
76views more  JOC 2002»
13 years 3 months ago
A Note on Negligible Functions
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
Mihir Bellare