New Data Seal
From Wikipedia, the free encyclopedia
| Derived from: | DES |
|---|---|
| Key size(s): | 2048 bits |
| Block size(s): | 128 bits |
| Structure: | Feistel network |
| Rounds: | 16 |
| Best public cryptanalysis: | |
| Grossman & Tuckerman's slide attack uses at most 212 chosen plaintexts | |
In cryptography, New Data Seal (NDS) is a block cipher that was designed based on DES and briefly studied in the 1970s.
The algorithm uses a block size of 128 bits, and a very large key size of 2048 bits. Like DES it has a 16-round Feistel network structure. The round function uses two fixed 4×4-bit S-boxes, chosen to be non-affine. The key is also treated as an 8×8-bit lookup table, using the first bit of each of the 8 bytes of the half-block as input. The nth bit of the output of this table determines whether or not the two nibbles of the nth byte are swapped after S-box substitution. All rounds use the same table.
In 1977, Edna Grossman and Bryant Tuckerman cryptanalyzed NDS using the first known slide attack. This method uses no more than 4096 chosen plaintexts; in their best trial they recovered the key with only 556 chosen plaintexts.
[edit] References
- Henry Beker and Fred Piper (1982). Cipher Systems: The Protection of Communications. John Wiley & Sons, 263-267. ISBN 0-471-89192-4.
 |
This cryptography-related article is a stub. You can help Wikipedia by expanding it. |
