Sciweavers

9 search results - page 1 / 2
» Nonce Generators and the Nonce Reset Problem
Sort
View
ISW
2009
Springer
13 years 11 months ago
Nonce Generators and the Nonce Reset Problem
A nonce is a cryptographic input value which must never repeat within a given context. Nonces are important for the security of many cryptographic building blocks, such as stream c...
Erik Zenner
CCS
2008
ACM
13 years 6 months ago
Using rhythmic nonces for puzzle-based DoS resistance
To protect against replay attacks, many Internet protocols rely on nonces to guarantee freshness. In practice, the server generates these nonces during the initial handshake, but ...
Ellick Chan, Carl A. Gunter, Sonia Jahid, Evgeni P...
JOC
2002
99views more  JOC 2002»
13 years 4 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
DCC
2003
IEEE
14 years 4 months ago
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
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 s...
Phong Q. Nguyen, Igor Shparlinski
CRYPTO
2007
Springer
130views Cryptology» more  CRYPTO 2007»
13 years 11 months ago
A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator
An elliptic curve random number generator (ECRNG) has been approved in a NIST standards and proposed for ANSI and SECG draft standards. This paper proves that, if three conjecture...
Daniel R. L. Brown, Kristian Gjøsteen