67 search results - page 5 / 14 » crypto 2007 |
CRYPTO
2007
Springer
15 years 4 months ago
2007
Springer
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...
CRYPTO
2007
Springer
15 years 4 months ago
2007
Springer
Wiener’s famous attack on RSA with d < N0.25 shows that using a small d for an efficient decryption process makes RSA completely insecure. As an alternative, Wiener proposed t...
CRYPTO
2007
Springer
15 years 4 months ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
111
click to vote
CRYPTO
2007
Springer
15 years 4 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
AMC
2005
14 years 10 months ago
2005
Three main methods with favorable security and efficiency can be considered in the design of cryptosystems. These methods are integer factorization systems (of which RSA is the be...