Minimalism in cryptography: The Even-Mansour scheme revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7237 LNCS, Issue , 2012, Pages 336-354

  Dunkelman, Orr ^a,b   Keller, Nathan ^b,c   Shamir, Adi ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c BAR ILAN UNIVERSITY   (Israel)

Author keywords

Even Mansour block cipher; minimalism; provable security; slide attacks; slidex attack; tight security bounds; whitening keys

Indexed keywords

BLOCK CIPHERS; MINIMALISM; PROVABLE SECURITY; SLIDE ATTACKS; SLIDEX ATTACK; TIGHT SECURITY BOUNDS; WHITENING KEYS;

PROBLEM SOLVING; SECURITY OF DATA;

CRYPTOGRAPHY;

EID: 84859980301     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29011-4_21     Document Type: Conference Paper

References (16)

1. Biham, E., Dunkelman, O., Keller, N.: Improved Slide Attacks. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 153-166. Springer, Heidelberg (2007)
2. Biham, E., Shamir, A.: Differential Cryptanalysis of the Data Encryption Standard. Springer (1993)
3. Biryukov, A., Wagner, D.: Slide Attacks. In: Knudsen, L.R. (ed.) FSE 1999. LNCS, vol. 1636, pp. 245-259. Springer, Heidelberg (1999)
4. Biryukov, A., Wagner, D.: Advanced Slide Attacks. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 589-606. Springer, Heidelberg (2000)
5. Daemen, J.: Limitations of the Even-Mansour Construction. In: [11], pp. 495-498
6. Dinur, I., Dunkelman, O., Shamir, A.: Improved Attacks on GOST. Technical report, to appear (2011)
7. Dunkelman, O., Keller, N., Shamir, A.: Minimalism in Cryptography: The Even-Mansour Scheme Revisited. Cryptology ePrint Archive, Report 2011/541 (2011), http://eprint.iacr.org/
8. Even, S., Mansour, Y.: A Construction of a Cipher From a Single Pseudorandom Permutation. In: [11], pp. 210-224
9. Even, S., Mansour, Y.: A Construction of a Cipher from a Single Pseudorandom Permutation. J. Cryptology 10(3), 151-162 (1997)
10. Floyd, R.W.: Nondeterministic Algorithms. J. ACM 14(4), 636-644 (1967)
11. Imai, H., Rivest, R.L., Matsumoto, T. (eds.): ASIACRYPT 1991. LNCS, vol. 739. Springer, Heidelberg (1993)
12. Kilian, J., Rogaway, P.: How to Protect DES Against Exhaustive Key Search (an Analysis of DESX). J. Cryptology 14(1), 17-35 (2001)
13. Kurosawa, K.: Power of a Public Random Permutation and Its Application to Authenticated Encryption. IEEE Transactions on Information Theory 56(10), 5366-5374 (2010)
14. Nivasch, G.: Cycle Detection Using a Stack. Inf. Process. Lett. 90(3), 135-140 (2004)
15. Rivest, R.L.: DESX. Never published (1984)
16. Russian National Bureau of Standards: Federal Information Processing Standard-Cryptographic Protection-Cryptographic Algorithm. GOST 28147-89 (1989)