Cascade encryption revisited

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

Volumn 5912 LNCS, Issue , 2009, Pages 37-51

  Gaži, Peter ^a,b   Maurer, Ueli ^a  

^a ETH ZURICH   (Switzerland)

^b Physics and Informatics   (Slovakia)

Author keywords

Cascade encryption; Ideal cipher model; Indistinguishability; Random system

Indexed keywords

IDEAL-CIPHER MODEL; INDISTINGUISHABILITY; KEY SPACE; MESSAGE SPACE; PROOF STRATEGY; RANDOM SYSTEMS;

NETWORK SECURITY;

CRYPTOGRAPHY;

EID: 72449200676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10366-7_3     Document Type: Conference Paper

References (15)

1. Aiello, W., Bellare, M., Di Crescenzo, G., Venkatesan, R.: Security Amplification by Composition: The case of Doubly-Iterated, Ideal Ciphers. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 499-558. Springer, Heidelberg (1998)
2. ANSI X9.52, Triple Data Encryption Algorithm Modes of Operation (1998)
3. Bellare, M., Namprempre, Ch.: Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm, full version, Cryptology ePrint Archive, Report 2000/025 (2007)
4. Bellare, M., Rogaway, P.: Code-Based Game-Playing Proofs and the Security of Triple Encryption. In: Eurocrypt 2006. LNCS, vol. 4004, pp. 409-426. Springer, Heidelberg (2006), http://eprint.iacr.org/2004/331
5. Bellare, M., Ristenpart, T.: Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 399-410. Springer, Heidelberg (2007)
6. Coron, J.S., Patarin, J., Seurin, Y.: The Random Oracle Model and the Ideal Cipher Model are Equivalent. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 1-20. Springer, Heidelberg (2008)
7. Diffie, W., Hellman, M.: Exhaustive Cryptanalysis of the Data Encryption Standard. Computer 10, 74-84 (1977)
8. Even, S., Goldreich, O.: On the Power of Cascade Ciphers. ACM Transactions on Computer Systems 3(2), 108-116 (1985)
9. Even, S., Mansour, Y.: A Construction of a Cipher from a Pseudorandom Permutation. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol. 739, pp. 210-224. Springer, Heidelberg (1993)
10. Maurer, U.: Indistinguishability of Random Systems. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 110-132. Springer, Heidelberg (2002)
11. Maurer, U., Massey, J.: Cascade Ciphers: the Importance of Being First. J. of Cryptology 6(1), 55-61 (1993)
12. Maurer, U., Pietrzak, K., Renner, R.: Indistinguishability Amplification. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 130-149. Springer, Heidelberg (2007)
13. National Institute of Standards and Technology: FIPS PUB 46-3: Data Encryption Standard (DES) (1999)
14. National Institute of Standards and Technology: Recommendation for the Triple Data Encryption Algorithm (TDEA) Block Cipher, NIST Special Publication 800-67 (2004)
15. Rogaway, P., Shrimpton, T.: Deterministic Autenticated-Encryption. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 373-390. Springer, Heidelberg (2006)