DataTerminology.comNEW
Also known as: Feistel Network
A keyed round transformation in Feistel networks that mixes one half-block into the other to provide diffusion and confusion across rounds.
DESCRIPTION
The Feistel function F is the core building block of Feistel ciphers, combining a data half with a subkey to produce a pseudorandom output. Each round applies F to one half and XORs the result into the other half, often followed by a swap. Security depends critically on F’s nonlinearity and avalanche properties, commonly achieved with S-boxes and permutations. Well-designed F functions resist differential and linear cryptanalysis by disrupting input-output correlations. DES popularized Feistel designs, while modern ciphers often use SPN structures like AES.
ALTERNATIVE DEFINITIONS
Wikipedia
In a Feistel network, the cipher operates by splitting the block into two halves and repeatedly applying a round function to one half and XORing the result into the other half.
Explains the operational role of the round function within the structure.
Handbook of Applied Cryptography
A Feistel cipher consists of repeated applications of a round function to one half of the data and combining the result with the other half.
Textbook framing of Feistel round function usage across rounds.
RELATED TERMS
Feistel Function Basics Symmetric Block Cipher Algorithms Data Encryption Standard Round Function Key Schedule Differential Cryptanalysis Linear Cryptanalysis
COMPETING TERMS
Substitution–Permutation Network
RELATIONS
- Narrower: The Feistel Function
KNOWLEDGE AREAS
Data Security Software Engineering Mathematics
TARGET AUDIENCE
Cybersecurity Engineer Security Architect Software Developer IT Auditor Solution Architect
EXTERNAL SOURCES
- Wikipedia - Feistel cipher
- FIPS PUB 46-3 - DES specification using Feistel rounds
- Applied Cryptography - Reference discussing Feistel designs
TOP QUESTIONS
What properties should a Feistel Function have?
It should be nonlinear, exhibit strong avalanche effects, and resist differential and linear attacks while being efficient for the target platform.
Category: Requirements
Why does the Feistel Function allow decryption with the same structure?
Because only XOR and swapping are used between halves, reversing the subkey order inverts the process without needing F to be invertible.
Category: Mechanism
How is the Feistel Function designed in DES?
DES uses expansion, key mixing, S-box substitution, and permutation to produce nonlinear diffusion.
Category: Example
What is a common mistake when implementing a Feistel Function?
Using weak S-boxes or inadequate mixing that leaves exploitable correlations across rounds.
Category: Mistakes
How many rounds make a Feistel cipher secure?
It depends on F; practical designs use enough rounds (e.g., 16 in DES) to diffuse dependencies and thwart known attacks.
Category: Opinion
How does a Feistel Function compare to SPN round functions?
Feistel functions act on half-blocks and need not be invertible; SPN round functions transform the full state and require global invertibility.
Category: Comparison
Where is the Feistel Function used today?
Primarily in legacy or specialized ciphers; modern mainstream encryption favors SPNs like AES.
Category: Relevancy
How do key schedules interact with the Feistel Function?
Subkeys fed to F per round must avoid symmetry or related-key weaknesses to ensure security.
Category: Design
How to test a Feistel Function’s quality?
Use statistical tests for avalanche, differential probability, and linear bias, plus cryptanalytic evaluation.
Category: Validation