Welcome to the resource topic for 1998/023
Title:
Security amplification by composition: The case of doubly-iterated, ideal ciphers
Authors: William Aiello, Mihir Bellare, Giovanni Di Crescenzo, Ramarathnam Venkatesan
Abstract:We investigate, in the Shannon model, the security of constructions
corresponding to double and (two-key) triple DES. That is, we
consider Fk1(Fk2(.)) and
Fk1(Fk2-1(Fk1(.))) with
the component functions being ideal ciphers. This models the
resistance of these constructions to ``generic’’ attacks like meet
in the middle attacks.
We obtain the first proof that composition actually
increases the security in some meaningful sense. We compute a bound
on the probability of breaking the double cipher as a function of
the number of computations of the base cipher made, and the number
of examples of the composed cipher seen, and show that the success
probability is the square of that for a single key cipher. The
same bound holds for the two-key triple cipher. The first bound
is tight and shows that meet in the middle is the best possible
generic attack against the double cipher.
ePrint: https://eprint.iacr.org/1998/023
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .