277 search results - page 34 / 56 » The Whirlpool Secure Hash Function |
CCS
1999
ACM
14 years 28 days ago
1999
ACM
We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the the signer to maintain any state, and can be proven secure against ...
FSE
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. We provide the first proof of security for Tandem-DM, one of the oldest and most wellknown constructions for turning a blockcipher with n-bit blocklength and 2n-bit keyle...
FSE
1997
Springer
14 years 6 days ago
1997
Springer
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
CRYPTO
2007
Springer
14 years 2 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
SACRYPT
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The XCB mode of operation was outlined in 2004 as a contribution to the IEEE Security in Storage effort, but no security analysis was provided. In this paper, we provide...