Sciweavers

29 search results - page 3 / 6
» asiacrypt 2008
Sort
View
ASIACRYPT
2008
Springer
13 years 7 months ago
Speeding Up the Pollard Rho Method on Prime Fields
Abstract. We propose a method to speed up the r-adding walk on multiplicative subgroups of the prime field. The r-adding walk is an iterating function used with the Pollard rho alg...
Jung Hee Cheon, Jin Hong, Minkyu Kim
ASIACRYPT
2008
Springer
13 years 7 months ago
Limits of Constructive Security Proofs
The collision-resistance of hash functions is an important foundation of many cryptographic protocols. Formally, collision-resistance can only be expected if the hash function in f...
Michael Backes, Dominique Unruh
ASIACRYPT
2008
Springer
13 years 7 months ago
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
Recently Cash, Kiltz, and Shoup [20] showed a variant of the Cramer-Shoup (CS) public key encryption (PKE) scheme [21] whose chosen-ciphertext (CCA) security relies on the computa...
Goichiro Hanaoka, Kaoru Kurosawa
ASIACRYPT
2008
Springer
13 years 7 months ago
An Improved Impossible Differential Attack on MISTY1
MISTY1 is a Feistel block cipher that received a great deal of cryptographic attention. Its recursive structure, as well as the added FL layers, have been successful in thwarting v...
Orr Dunkelman, Nathan Keller
ASIACRYPT
2008
Springer
13 years 7 months ago
Ambiguous Optimistic Fair Exchange
Optimistic fair exchange (OFE) is a protocol for solving the problem of exchanging items or services in a fair manner between two parties, a signer and a verifier, with the help o...
Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Su...