TWEAKABLE BLOCKCIPHERS SECURE AGAINST GENERIC EXPONENTIAL ATTACKS (2007)

Cached

Download Links

by Elizabeth A. Crump
Citations:1 - 0 self

Documents Related by Co-Citation

4 Improved Security Analysis of XEX and LRW Modes – K Minematsu - 2006
2 A Study of Luby-Rackoff Ciphers – Zulfikar Ramzan - 2001
1 Full version of this paper, IACR eprint archive – D Goldenberg, S Hohenberger, M Liskov, E Crump Schwartz, H Seyalioglu - 2007
1 Exponential Attacks on Blockciper Families. Honors Thesis – Hakan Seyalioglu
2 The hasty pudding cipher. NIST AES proposal, available at http://www.cs.arizona.edu/∼rcs/hpc – R Schroeppel - 1998
8 a candidate cipher for AES – MARS - 1998
5 Cryptanalysis of the EMD mode of operation – A Joux
3 Feistel Networks made Public, and Applications – Yevgeniy Dodis, Prashant Puniya - 2007
26 On the impossibility of highly-efficient blockcipher-based hash functions – John Black, Martin Cochran, Thomas Shrimpton - 2005
93 On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited – Moni Naor , Omer Reingold - 1997
66 A tweakable enciphering mode – Shai Halevi, Phillip Rogaway - 2003
48 A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications – Mihir Bellare, Tadayoshi Kohno - 2003
21 Mercy: A fast large block cipher for disk sector encryption – Paul Crowley - 2000
30 EME: extending EME to handle arbitrary-length messages with associated data – Shai Halevi - 2004
24 Faster Luby-Rackoff Ciphers – Stefan Lucks - 1996
40 Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC – Phillip Rogaway - 2003
20 Security of random feistel schemes with 5 or more rounds – Jacques Patarin - 2004
7 Luby-Rackoff: 7 rounds are enough for 2 n(1−ε) security – Jacques Patarin - 2003
281 How to construct pseudorandom permutations from pseudorandom functions – M Luby, C Rackoff - 1988