Shimon Even and Oded Goldreich. On the power of cascade ciphers. ACM Trans. Comput. Syst., 3(2):108-116, 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Security Amplification by Composition: The case of.. - Aiello, Bellare, al. (1998) (6 citations) (Correct)
....two key triple DES against cryptanalysis coupled with the proven strength against generic attacks seem to make a strong combination that is absent for DESX. The basic meet in the middle attacks are due to [5, 12] Even and Goldreich provide some time space tradeoffs for meet in the middle attacks [6], and Van Oorschot and Wiener [14] reduce the space requirements. Even and Goldreich [6] had shown that the cascade of m ciphers is at least as strong as its strongest component. Maurer and Massey [10] argued that this result required restrictions in the model, and also showed that the cascade is ....
....attacks seem to make a strong combination that is absent for DESX. The basic meet in the middle attacks are due to [5, 12] Even and Goldreich provide some time space tradeoffs for meet in the middle attacks [6] and Van Oorschot and Wiener [14] reduce the space requirements. Even and Goldreich [6] had shown that the cascade of m ciphers is at least as strong as its strongest component. Maurer and Massey [10] argued that this result required restrictions in the model, and also showed that the cascade is at least as strong as its first component. Our work is the first to show that the ....
S. Even and O. Goldreich, "On the power of cascade ciphers," ACM Transactions on Computer Systems, Vol. 3, No. 2, May 1985, pp. 108--116.
Cryptology - Rivest (Correct)
....and looking for overlaps, one can identify a pair of keys that take the given plaintext to the given ciphertext. Thus the composed system has diculty proportional to 2 n , rather than proportional to 2 2n , as one would naively expect. One very intuitive result, due to Even and Goldreich [60] (see also [10] is that the composition of encryption schemes A and B is no weaker than A or B individually security is not lost by composition. They assume that the two encryption keys are chosen independently and that the adversary can request the encryption of arbitrary text (that is, he can ....
S. Even and O. Goldreich. On the power of cascade ciphers. ACM Trans. Computer Systems, 3:108-116, May 1985.
Cryptology - Rivest (1990) (Correct)
....and looking for overlaps, one can identify a pair of keys that take the given plaintext to the given ciphertext. Thus the composed system has difficulty proportional to 2 n , rather than proportional to 2 2n , as one would naively expect. One very intuitive result, due to Even and Goldreich [60] (see also [10] is that the composition of encryption schemes A and B is no weaker than A or B individually security is not lost by composition. They assume that the two encryption keys are chosen independently and that the adversary can request the encryption of arbitrary text (that is, he ....
S. Even and O. Goldreich. On the power of cascade ciphers. ACM Trans. Computer Systems, 3:108--116, May 1985.
Multiple Encryption with Minimum Key - Damgård, Knudsen (1995) (1 citation) (Correct)
....decryption in X under key K. We assume that the key space of X consists of all k bit strings, and that the block length of X is m. In a cascade of ciphers it is assumed that the keys of the component ciphers are independent. The following result was proved by Even and Goldreich. Theorem1 [2]. A cascade of ciphers is at least as hard to break under any attack as any of the component ciphers in the cascade under a chosen plaintext attack. As seen, the result establishes a connection between the cascade and the component ciphers under a chosen plaintext attack on the latter. The ....
S. Even and O. Goldreich. On the power of cascade ciphers. ACM Trans. on Computer Systems, 3:108--116, 1985.
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006) (Correct)
No context found.
Shimon Even and Oded Goldreich. On the power of cascade ciphers. ACM Trans. Comput. Syst., 3(2):108-116, 1985.
Parallel Collision Search with Cryptanalytic Applications - van Oorschot, Wiener (1996) (51 citations) (Correct)
No context found.
S. Even and O. Goldreich, "On the Power of Cascade Ciphers", ACM Transactions on Computer Systems, vol. 3, no. 2, May 1985.
Improving Implementable Meet-in-the-Middle Attacks by.. - van Oorschot, Wiener (1996) (Correct)
No context found.
S. Even and O. Goldreich, "On the Power of Cascade Ciphers", ACM Transactions on Computer Systems, vol. 3, no. 2, May 1985.
Integrity Checks Used for Security Can Also Be Used for Error .. - Tim Moors Moors (Correct)
No context found.
S. Even and O. Goldreich: "On the power of cascade ciphers", ACM Trans. Comp. Sys., 3(2):108-16, May 1985
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC