| General | |
|---|---|
| Designers | Terry Ritter |
| First published | February 22, 1994 |
| Derived from | DES |
| Related to | DEAL |
| Cipher detail | |
| Key sizes | 224 bits |
| Block sizes | 128 bits |
| Structure | NestedFeistel network |
| Rounds | 4 |
| Best publiccryptanalysis | |
| Eli Biham's attacks require 236 plaintext-ciphertext pairs and 290 work | |
Incryptography,Ladder-DES is ablock cipher designed in 1994 by Terry Ritter. It is a 4-roundFeistel cipher with ablock size of 128 bits, usingDES as the round function. It has no actualkey schedule, so the totalkey size is 4×56=224 bits.
In 1997,Eli Biham found two forms ofcryptanalysis for Ladder-DES that depend on thebirthday paradox; thekey is deduced from the presence or absence ofcollisions, plaintexts that give equal intermediate values in the encryption process. He presented both achosen-plaintext attack and aknown-plaintext attack; each uses about 236 plaintexts and 290 work, but the known-plaintext attack requires much more memory.
 | This cryptography-related article is astub. You can help Wikipedia byadding missing information. |
