Advertisement
Published in:
2006 | OriginalPaper | Chapter
The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
Authors : Mihir Bellare, Phillip Rogaway
Published in: Advances in Cryptology - EUROCRYPT 2006
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We show that, in the ideal-cipher model, triple encryption (the cascade of three independently-keyed blockciphers) is more secure than single or double encryption, thereby resolving a long-standing open problem. Our result demonstrates that for DES parameters (56-bit keys and 64-bit plaintexts) an adversary’s maximal advantage against triple encryption is small until it asks about 2
78
queries. Our proof uses code-based game-playing in an integral way, and is facilitated by a framework for such proofs that we provide.