NewDES

NewDES
NewDES
General
Designers Robert Scott
First published 1985
Cipher detail
Key sizes 120 bits
Block sizes 64 bits
Rounds 17
Best public cryptanalysis
A related-key attack succeeds with 232 known plaintexts

In cryptography, NewDES is a symmetric key block cipher. It was created in 1984–1985 by Robert Scott as a potential DES replacement. Despite its name, it is not derived from DES and has a quite different structure. Its intended niche as a DES replacement has now mostly been filled by AES. The algorithm was revised with a modified key schedule in 1996 to counter a related-key attack; this version is sometimes referred to as NewDES-96.

In 2004, Scott posted some comments on sci.crypt reflecting on the motivation behind NewDES's design and what he might have done differently to make the cipher more secure [1].

Contents

The algorithm

NewDES, unlike DES, has no bit-level permutations, making it easy to implement in software. All operations are performed on whole bytes. It is a product cipher, consisting of 17 rounds performed on a 64-bit data block and makes use of a 120-bit key. In each round, subkey material is XORed with the 1-byte sub-blocks of data, then fed through an S-box, the output of which is then XORed with another sub-block of data. In total, 8 XORs are performed in each round. The S-box is derived from the United States Declaration of Independence (to show that Scott had nothing up his sleeve).

Each set of two rounds uses seven 1-byte subkeys, which are derived by splitting 56 bits of the key into bytes. The key is then rotated 56 bits for use in the next two rounds.

Cryptanalysis of NewDES

Only a small amount of cryptanalysis has been published on NewDES. The designer showed that NewDES exhibits the full avalanche effect after seven rounds: every ciphertext bit depends on every plaintext bit and key bit.

NewDES has the same complementation property that DES has: namely, that if

EK(P) = C,

then

E_{\overline{K}}(\overline{P})=\overline{C},

where

\overline{x}

is the bitwise complement of x. This means that the work factor for a brute force attack is reduced by a factor of 2. Eli Biham also noticed that changing a full byte in all the key and data bytes leads to another complementation property. This reduces the work factor by 28.

Biham's related-key attack can break NewDES with 233 chosen-key chosen plaintexts, meaning that NewDES is not as secure as DES.

John Kelsey, Bruce Schneier, and David Wagner used related-key cryptanalysis to develop another attack on NewDES; it requires 232 known plaintexts and one related key.[1]

References

  1. ^ John Kelsey, Bruce Schneier, and David Wagner. Related-key cryptanalysis of 3-WAY, Biham-DES, CAST, DES-X, NewDES, RC2, and TEA. Lecture Notes in Computer Science 1334, pp233–246, 1997 (PS or PDF).
  • R. Scott, "Wide Open Encryption Design Offers Flexible Implementations," Cryptologia, v. 9, n. 1, Jan 1985, pp. 75-90.
  • {{cite book

External links

 | last = Schneier
 | first = Bruce
 | authorlink  = Bruce Schneier
 | title = Applied Cryptography, Second Edition
 | publisher = John Wiley & Sons
 | date = 1996
 | pages = 306–308
 | isbn = 0-471-11709-9 }}

Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • NewDES — Résumé Concepteur(s) Robert Scott Première publication 1984 1985 (révision en 1996) Dérivé de Aucun Chiffrement(s) basé(s) sur cet algorithme NewDES 1996 …   Wikipédia en Français

  • NewDES — Создатель: Роберт Скот Создан: 1985 г. Опубликован: 1985 г. Размер ключа: 120 бит Размер блока: 64 бит Число раундов: 17 NewDES (NewDES 96)  в …   Википедия

  • Data Encryption Standard — The Feistel function (F function) of DES General Designers IBM First publis …   Wikipedia

  • Nothing up my sleeve number — In cryptography, nothing up my sleeve numbers are any numbers which, by their construction, are above suspicion of hidden properties. They are used in creating cryptographic functions such as hashes and ciphers. These algorithms often need… …   Wikipedia

  • RC2 — Résumé Concepteur(s) Ronald Rivest, NSA Première publication conçu en 1987, publié en 1996 Dériv …   Wikipédia en Français

  • Шифрование — Шифрование  преобразование информации в целях сокрытия от неавторизованных лиц, с предоставлением, в это же время, авторизованным пользователям доступа к ней. Главным образом, шифрование служит задаче соблюдения конфиденциальности… …   Википедия

  • Блочный шифр — Общая схема работы блочного шифра Блочный шифр  разновидность симметричного шифра …   Википедия

  • TEA — Эту статью следует викифицировать. Пожалуйста, оформите её согласно правилам оформления статей. У этого термина существуют и другие значения, см. TEA (значения) …   Википедия

  • XTEA — Создатель: Дэвид Уилер и Роджер Нидхэм Создан: 1997 г …   Википедия

  • 3-WAY — Создатель: Йоан Даймен (Joan Daeman) Опубликован: 1994 год Размер ключа: 96 бит Размер блока: 96 бит Число раундов: 11 3 WAY  это симметричный блочный шифр с закрытым ключом, разработанный Йоаном Дайменом (Joan Daeman) …   Википедия

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”