Attacking Triple Encryption

@inproceedings{Lucks1998AttackingTE,
  title={Attacking Triple Encryption},
  author={Stefan Lucks},
  booktitle={FSE},
  year={1998}
}
  • S. Lucks
  • Published in FSE 23 March 1998
  • Computer Science, Mathematics
The standard technique to attack triple encryption is the meet-in-the-middle attack which requires 2 112 encryption steps. In this paper, more efficient attacks are presented. One of our attacks reduces the overall number of steps to roughly 2 108 . Other attacks optimize the number of encryptions at the cost of increasing the number of other operations. It is possible to break triple DES doing 2 90 single encryptions and no more than 2 113 faster operations. 
Related-key attack against triple encryption based on fixed points
  • S. Vaudenay
  • Computer Science, Mathematics
    Proceedings of the International Conference on Security and Cryptography
  • 2011
TLDR
This paper focuses on triple encryption mode, which was proposed to increase the security of single encryption when the key is too short and proposed a related-key attack which can break it at a price similar to breaking single encryption.
A Universal Encryption Standard
TLDR
This paper proposes a secure and simple double block-length encryption algorithm that remains totally compliant with DES and triple-DES specifications as well as with AES requirements.
Fast encryption for set-top technologies
TLDR
Two approaches to combine recent results of cryptographic research with the requirements of modern multimedia systems are presented, based on recent developments regarding fast Luby-Rackoff ciphers and on implementation considerations for a specific multimedia project, the multimedia database for teleteaching at the University of Mannheim.
The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
TLDR
It is demonstrated 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 278 queries.
Security Implications of Using the Data Encryption Standard (DES)
TLDR
The Data Encryption Standard is susceptible to brute-force attacks, which are well within the reach of a modestly financed adversary, and this note discusses DES security implications in detail so that designers and implementers have all the information they need to make judicious decisions regarding its use.
A Study: Cryptology Techniques and Methodologies
TLDR
This paper attempts to define the existing cryptology techniques and measures how strong and ‘bullet proof’ they are and shows a basic encryption, byte to byte and complex encryption as a study of cryptosystem classes that were used to overcome the need from various users.
Fast Encryption for Set { Top
TLDR
Two approaches to combine recent results of cryptographic research with the requirements of modern multimedia systems are presented and implementation considerations for a speciic multimedia project, the multimedia database for teleteaching at the University of Mannheim are discussed.
On the Security of Double and 2-Key Triple Modes of Operation
TLDR
An improved attack on multiple modes that contain an OFB mode is presented and practical solutions that take into account realistic constraints are discussed.
Light but Effective Encryption Technique based on Dynamic Substitution and Effective Masking
TLDR
This paper proposes an innovative encryption technique that has unique features that make it different from the other standard encryption methods and advocates the use of dynamic substitution and tricky manipulation operations that introduce tremendous confusion and diffusion to ciphertext.
Block Ciphers and Stream Ciphers: The State of the Art
  • A. Biryukov
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2004
TLDR
The area of symmetric key encryption has been very active in the last five years due to growing interest from academic and industry research, standardization efforts like AES, NESSIE and CRYPTREC, as well as due to ease of government control over export of cryptography.
...
...

References

SHOWING 1-10 OF 12 REFERENCES
On the security of multiple encryption
TLDR
It is shown that although either technique significantly improves security over single encryption, the new technique does not significantly increase security over simple double encryption.
A Known Plaintext Attack on Two-Key Triple Encryption
TLDR
A chosen-plaintext attack on two-key triple encryption noted by Mcrkle and Hellman is extended to a known-plain text attack, which is a significant improvement over aknown- Plaintext brute-force attack, but is still not seen as a serious threat to two- key triple encryption.
Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
TLDR
New attacks based on the principles of related-key differential cryptanalysis are presented, which can be exploited in actual protocols and cryptanalyze the key schedules of a variety of algorithms, including three-key Iriplc-DES.
How to Forge DES-Encrypted Messages in $2^{28}$ Steps
  • E. Biham
  • Computer Science, Mathematics
  • 1996
TLDR
It is shown that the theoretic strength of a cipher cannot exceed the square root of the size of the key space, and some DES keys can be recovered while they are still in use, and these keys can then be used to forge messages.
Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude
TLDR
A technique based on parallel collision search is described which requires O(√n/w) times fewer operations and O(n/W) times less memory accesses than previous approaches to meet-in-the-middle attacks.
How to Protect DES Against Exhaustive Key Search
TLDR
This paper proves, in a formal model, that the DESX construction is sound, and shows that, when F is an idealized block cipher, FXk.k2 is substantially more resistant to key search than is F, and has an effective key length of at least ϰ+n - 1 - lg m bits.
Handbook of Applied Cryptography
From the Publisher: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of
PayWord and MicroMint: Two Simple Micropayment Schemes
TLDR
Ve presents two simple micropayment schemes, "PayWord" and :'MicroMint," for making small purchases over the Internet, using hash operations instead whenever possible to minimize the number of public-key operations required per payment.
P
  • Rogaway, How to protect DES against exhaustive key search, Crypto ’96, Springer LNCS
  • 1109
two simple micropayment schemes
  • 7{11. This paper was published at: S. Vaudenay (ed.): Fast Software Encryption
  • 1996
...
...