FEAL
Sign in to saveIn cryptography, FEAL (the Fast data Encipherment Algorithm) is a block cipher proposed as an alternative to the Data Encryption Standard (DES), and designed to be much faster in software. The Feistel based algorithm was first published in 1987 by Akihiro Shimizu and Shoji Miyaguchi from NTT. The cipher is susceptible to various forms of cryptanalysis, and has acted as a catalyst in the discovery of differential and linear cryptanalysis.
Key facts
- Block cipher.name
- FEAL
- Block cipher.image
- 300px|center
- Block cipher.caption
- The FEAL Feistel function
- Block cipher.designers
- Akihiro Shimizu and Shoji Miyaguchi (NTT)
- Block cipher.publish date
- FEAL-4 in 1987; FEAL-N/NX in 1990
- Block cipher.key size
- 64 bits (FEAL), 128 bits (FEAL-NX)
- Block cipher.block size
- 64 bits
- Block cipher.structure
- Feistel network
- Block cipher.rounds
- Originally 4, then 8, then variable (recommended 32)
- Block cipher.cryptanalysis
- Linear cryptanalysis can break FEAL-4 with 5 known plaintexts (Matsui and Yamagishi, 1992). A differential attack breaks FEAL-N/NX with fewer than 31 rounds (Biham and Shamir, 1991).
via Wikipedia infobox
Article
4 sectionsContents
- See also
- Notes
- References
- External links
In cryptography, FEAL (the Fast data Encipherment Algorithm) is a block cipher proposed as an alternative to the Data Encryption Standard (DES), and designed to be much faster in software. The Feistel based algorithm was first published in 1987 by Akihiro Shimizu and Shoji Miyaguchi from NTT. The cipher is susceptible to various forms of cryptanalysis, and has acted as a catalyst in the discovery of differential and linear cryptanalysis.
There have been several different revisions of FEAL, though all are Feistel ciphers, and make use of the same basic round function and operate on a 64-bit block. One of the earliest designs is now termed FEAL-4, which has four rounds and a 64-bit key.