In cryptography, a Feistel cipher is a symmetric structure used in the construction of block ciphers, named after the German-born physicist and cryptographer Horst Feistel who did pioneering research while working for IBM (USA); it is also commonly known as a Feistel network. A large proportion of block ciphers use the scheme, including the Data Encryption Standard (DES). The Feistel structure has the advantage that encryption and decryption operations are very similar, even identical in some cases, requiring only a reversal of the key schedule. Therefore, the size of the code or circuitry required to implement such a cipher is nearly halved.
A Feistel network is an iterated cipher with an internal function called a round function.
Feistel networks were first seen commercially in IBM's Lucifer cipher, designed by Horst Feistel and Don Coppersmith in 1973. Feistel networks gained respectability when the U.S. Federal Government adopted the DES (a cipher based on Lucifer, with changes made by the NSA). Like other components of the DES, the iterative nature of the Feistel construction makes implementing the cryptosystem in hardware easier (particularly on the hardware available at the time of DES's design).
Many modern and also some old symmetric block ciphers are based on Feistel networks (e.g. GOST 28147-89 block cipher), and the structure and properties of Feistel ciphers have been extensively explored by cryptographers. Specifically, Michael Luby and Charles Rackoff analyzed the Feistel cipher construction, and proved that if the round function is a cryptographically secure pseudorandom function, with Ki used as the seed, then 3 rounds are sufficient to make the block cipher a pseudorandom permutation, while 4 rounds are sufficient to make it a "strong" pseudorandom permutation (which means that it remains pseudorandom even to an adversary who gets oracle access to its inverse permutation).
Because of this very important result of Luby and Rackoff, Feistel ciphers are sometimes called Luby–Rackoff block ciphers. Further theoretical work has generalized the construction somewhat, and given more precise bounds for security.
Let be the round function and let be the sub-keys for the rounds respectively.
Then the basic operation is as follows:
Split the plaintext block into two equal pieces, (, )
For each round , compute
Where means XOR. Then the ciphertext is .
Decryption of a ciphertext is accomplished by computing for
Then is the plaintext again.
One advantage of the Feistel model compared to a substitution–permutation network is that the round function does not have to be invertible.
The diagram illustrates both encryption and decryption. Note the reversal of the subkey order for decryption; this is the only difference between encryption and decryption.
Unbalanced Feistel cipher
Unbalanced Feistel ciphers use a modified structure where and are not of equal lengths. The Skipjack cipher is an example of such a cipher. The Texas Instruments digital signature transponder uses a proprietary unbalanced Feistel cipher to perform challenge–response authentication.
The Feistel construction is also used in cryptographic algorithms other than block ciphers. For example, the optimal asymmetric encryption padding (OAEP) scheme uses a simple Feistel network to randomize ciphertexts in certain asymmetric key encryption schemes.
Feistel networks as a design component
Whether the entire cipher is a Feistel cipher or not, Feistel-like networks can be used as a component of a cipher's design. For example, MISTY1 is a Feistel cipher using a three-round Feistel network in its round function, Skipjack is a modified Feistel cipher using a Feistel network in its G permutation, and Threefish (part of Skein) is a non-Feistel block cipher that uses a Feistel-like MIX function.
List of Feistel ciphers
Feistel or modified Feistel:
- Stream cipher
- Substitution–permutation network
- Lifting scheme for discrete wavelet transform has pretty much the same structure
- Format-preserving encryption
- Lai–Massey scheme
- Menezes, Alfred J.; Oorschot, Paul C. van; Vanstone, Scott A. (2001). Handbook of Applied Cryptography (Fifth ed.). p. 251. ISBN 978-0849385230.
- Luby, Michael; Rackoff, Charles (April 1988), "How to Construct Pseudorandom Permutations from Pseudorandom Functions", SIAM Journal on Computing, 17 (2): 373–386, doi:10.1137/0217022, ISSN 0097-5397
- Patarin, Jacques (October 2003), Boneh, Dan, ed., "Luby–Rackoff: 7 Rounds Are Enough for 2n(1−ε) Security" (PDF), Advances in Cryptology—CRYPTO 2003, Lecture Notes in Computer Science, 2729: 513–529, doi:10.1007/b11817, ISBN 978-3-540-40674-7, retrieved 2009-07-27
- Zheng, Yuliang; Matsumoto, Tsutomu; Imai, Hideki (1989-08-20). On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses. Advances in Cryptology — CRYPTO' 89 Proceedings. Lecture Notes in Computer Science. 435. pp. 461–480. doi:10.1007/0-387-34805-0_42. ISBN 978-0-387-97317-3.
- Schneier, Bruce; Kelsey, John (1996-02-21). Unbalanced Feistel networks and block cipher design. Fast Software Encryption. Lecture Notes in Computer Science. 1039. pp. 121–144. doi:10.1007/3-540-60865-6_49. ISBN 978-3-540-60865-3. Retrieved 2017-11-21.
- Bono, Stephen; Green, Matthew; Stubblefield, Adam; Juels, Ari; Rubin, Aviel; Szydlo, Michael (2005-08-05). "Security Analysis of a Cryptographically-Enabled RFID Device" (PDF). Proceedings of the USENIX Security Symposium. Retrieved 2017-11-21.
- Morris, Ben; Rogaway, Phillip; Stegers, Till (2009). How to Encipher Messages on a Small Domain (PDF). Advances in Cryptology - CRYPTO 2009. Lecture Notes in Computer Science. 5677. pp. 286–302. doi:10.1007/978-3-642-03356-8_17. ISBN 978-3-642-03355-1. Retrieved 2017-11-21.