87 search results - page 2 / 18 » On Hashing with Tweakable Ciphers |
CTRSA
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. Online ciphers are deterministic length-preserving permutations EK : ({0, 1}n )+ → ({0, 1}n )+ where the i-th block of ciphertext depends only on the first i blocks of...
INFORMATICASI
2002
13 years 5 months ago
2002
At PKC 2000, Inoue and Sakurai proposed some methods to design hash functions from block ciphers and codes (block codes and convolutional codes). They claimed that their hash func...
TCC
2010
Springer
14 years 2 months ago
2010
Springer
We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construc...
JOC
1998
13 years 5 months ago
1998
The security of hash functions based on a block cipher with a block length of m bits and a key length of k bits, where k ≤ m, is considered. New attacks are presented on a large ...
SACRYPT
2007
Springer
13 years 11 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...