Sources
Help build the largest human-edited directory on the web.
Submit a site - Become an editor
Wikipedia. Licensed under the GNU Free Documentation License.
Are you an expert in this subject? Join the discussion and share your knowledge at Wikipedia.org.
Triple DES
From Wikipedia, the free encyclopedia
| Triple DES | |
 Three successive invocations of DES
|
|
| General | |
|---|---|
| Designer(s): | IBM |
| First published: | 1978 |
| Derived from: | DES |
| Cipher detail | |
| Key size(s): | 112 (2TDES) or 168 bits (3TDES) |
| Block size(s): | 64 bits |
| Structure: | Feistel network |
| Rounds: | 48 DES-equivalent rounds |
| Best public cryptanalysis | |
| Lucks: 232 known plaintexts, 2113 operations including 290 DES encryptions, 288 memory; Biham: find one of 228 target keys with a handful of chosen plaintexts per key and 284 encryptions | |
In cryptography, Triple DES is a block cipher formed from the Data Encryption Standard (DES) cipher by using it three times.
Contents |
Triple DES is also known as TDES or, more standard, TDEA (Triple Data Encryption Algorithm [1]). The convention to use DES (the standard) when DEA (the algorithm) is intended is so widespread that in order to avoid confusion the term DES is used throughout this article. On the other hand, since there are variations of TDES which use two different keys (2TDES, officially 2TDEA) and three different keys (3TDES, officially 3TDEA) the non-standard abbreviation 3DES is confusing and should be avoided.
When it was found that a 56-bit key of DES is not enough to guard against brute force attacks, TDES was chosen as a simple way to enlarge the key space without a need to switch to a new algorithm. The use of three steps is essential to prevent meet-in-the-middle attacks that are effective against double DES encryption. Note that DES is not a group; if it were one, the TDES construction would be equivalent to a single DES operation and no more secure.
The simplest variant of TDES operates as follows: DES(k3;DES(k2;DES(k1;M))), where M is the message block to be encrypted and k1, k2, and k3 are DES keys. This variant is commonly known as EEE because all three DES operations are encryptions. In order to simplify interoperability between DES and TDES the middle step is usually replaced with decryption (EDE mode): DES(k3;DES-1(k2;DES(k1;M))) and so a single DES encryption with key k can be represented as TDES-EDE with k1 = k2 = k3 = k. The choice of decryption for the middle step does not affect the security of the algorithm.
In general TDES with three different keys (3-key TDES) has a key length of 168 bits: three 56-bit DES keys (with parity bits 3-key TDES has the total storage length of 192 bits), but due to the meet-in-the-middle attack the effective security it provides is only 112 bits. A variant, called two-key TDES (2-key TDES), uses k1 = k3, thus reducing the key size to 112 bits and the storage length to 128 bits. However, this mode is susceptible to certain chosen-plaintext or known-plaintext attacks [2] [3] and thus it is officially [4] designated to have only 80-bits of security.
As of 2005, the best attack known on 3-key TDES requires around 232 known plaintexts, 2113 steps, 290 single DES encryptions, and 288 memory[5] (the paper presents other tradeoffs between time and memory). This is not currently practical. If the attacker seeks to discover any one of many cryptographic keys, there is a memory-efficient attack which will discover one of 228 keys, given a handful of chosen plaintexts per key and around 284 encryption operations[6]. This attack is highly parallelizable and verges on the viable, given billion-dollar budgets[citation needed] and years[citation needed] to mount the attack, though the circumstances in which it would be useful are limited[citation needed][dubious ].
TDES is slowly disappearing from use, largely replaced by its natural successor, the Advanced Encryption Standard (AES). One large-scale exception is within the electronic payments industry, which still uses 2TDES extensively and continues to develop and promulgate standards based upon it (e.g. EMV). This guarantees that TDES will remain an active cryptographic standard well into the future.
By design, DES and therefore TDES, suffer from slow performance in software[citation needed]; on modern processors, AES tends to be around six[citation needed] times faster. TDES is better suited to hardware implementations[citation needed], and indeed where it is still used it tends to be with a hardware implementation (e.g., VPN appliances and the Nextel cellular and data network), but even there AES outperforms it[citation needed]. Finally, AES offers markedly higher security margins: a larger block size, potentially longer keys, and as of 2007, no known public cryptanalytic attacks[citation needed][dubious ].
- DES-X
- Walter Tuchman
- Horst Feistel
- Data Encryption Standard (DES)
- Advanced Encryption Standard (AES)
- ^ NIST, Recommendation for the Triple Data Encryption Algorithm (TDEA) Block Cipher (PDF), Special Publication 800-67.
- ^ Ralph Merkle, Martin Hellman: On the Security of Multiple Encryption (PDF), Communications of the ACM, Vol 24, No 7, pp 465–467, July 1981.
- ^ Paul van Oorschot, Michael J. Wiener , A known-plaintext attack on two-key triple encryption, EUROCRYPT'90, LNCS 473, 1990, pp 318–325.
- ^ NIST, Recommendation for Key Management — Part 1: general (PDF), Special Publication 800-57.
- ^ Stefan Lucks: Attacking Triple Encryption (PDF), Fast Software Encryption 1998, pp 239–253.
- ^ Eli Biham: How to Forge DES-Encrypted Messages in 228 Steps (PostScript), 1996.