Feistel network
E487732
A Feistel network is a symmetric structure for building block ciphers that splits data into halves and repeatedly applies round functions to achieve secure encryption and decryption.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Feistel network canonical | 5 |
| Lucifer cipher | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T5028138 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
Target entity: Feistel network Context triple: [RC2, cipherStructure, Feistel network]
-
A.
Substitution–permutation network
A substitution–permutation network is a symmetric-key cryptographic design that secures data by repeatedly applying nonlinear substitutions and bitwise permutations to achieve confusion and diffusion.
-
B.
SDES
SDES (Session Description Protocol Security Descriptions) is a key management mechanism used to negotiate and convey cryptographic parameters for securing media streams in real-time communication protocols.
-
C.
Rijndael
Rijndael is a symmetric block cipher designed by Joan Daemen and Vincent Rijmen that was selected by NIST as the basis for the Advanced Encryption Standard (AES).
-
D.
Twofish
Twofish is a symmetric key block cipher known for its speed, flexibility, and strong security, and was a finalist in the competition to become the Advanced Encryption Standard (AES).
-
E.
CBC-DES
CBC-DES is a cryptographic privacy protocol that uses the Data Encryption Standard in Cipher Block Chaining mode to provide confidentiality for SNMPv3 messages.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Feistel network Target entity description: A Feistel network is a symmetric structure for building block ciphers that splits data into halves and repeatedly applies round functions to achieve secure encryption and decryption.
-
A.
Substitution–permutation network
A substitution–permutation network is a symmetric-key cryptographic design that secures data by repeatedly applying nonlinear substitutions and bitwise permutations to achieve confusion and diffusion.
-
B.
SDES
SDES (Session Description Protocol Security Descriptions) is a key management mechanism used to negotiate and convey cryptographic parameters for securing media streams in real-time communication protocols.
-
C.
Rijndael
Rijndael is a symmetric block cipher designed by Joan Daemen and Vincent Rijmen that was selected by NIST as the basis for the Advanced Encryption Standard (AES).
-
D.
Twofish
Twofish is a symmetric key block cipher known for its speed, flexibility, and strong security, and was a finalist in the competition to become the Advanced Encryption Standard (AES).
-
E.
CBC-DES
CBC-DES is a cryptographic privacy protocol that uses the Data Encryption Standard in Cipher Block Chaining mode to provide confidentiality for SNMPv3 messages.
- F. None of above. chosen
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
block cipher structure
ⓘ
cryptographic construction ⓘ |
| advantage |
decryption uses same structure as encryption
ⓘ
flexible choice of round functions ⓘ good diffusion after sufficient rounds ⓘ round function need not be invertible ⓘ |
| appliesTo | symmetric-key cryptography ⓘ |
| coreOperation |
XOR of round function output with one half
ⓘ
repeated application of round function ⓘ swap of halves between rounds ⓘ |
| decryptionProcess | apply same rounds with subkeys in reverse order ⓘ |
| designGoal | build secure block ciphers from round functions ⓘ |
| developedAt | IBM NERFINISHED ⓘ |
| encryptionProcess | apply multiple Feistel rounds with subkeys in forward order ⓘ |
| field | cryptography ⓘ |
| hasProperty |
confusion and diffusion through multiple rounds
ⓘ
invertible transformation ⓘ iterative structure ⓘ supports same structure for encryption and decryption ⓘ symmetric structure ⓘ |
| introducedIn | 1970s ⓘ |
| namedAfter | Horst Feistel NERFINISHED ⓘ |
| operatesOn | fixed-size data blocks ⓘ |
| relatedConcept |
Substitution–permutation network
NERFINISHED
ⓘ
pseudorandom function ⓘ pseudorandom permutation ⓘ |
| requires | key schedule to derive round subkeys ⓘ |
| roundFunctionInput |
one half of the block
ⓘ
round subkey ⓘ |
| securityDependsOn |
key schedule design
ⓘ
number of rounds ⓘ round function design ⓘ |
| splitsInto |
left half
ⓘ
right half ⓘ |
| theoreticalResult | sufficiently many rounds with pseudorandom round functions yield a pseudorandom permutation ⓘ |
| typicalNumberOfRounds | multiple rounds for security ⓘ |
| usedBy |
Blowfish
NERFINISHED
ⓘ
CAST-128 NERFINISHED ⓘ Camellia NERFINISHED ⓘ DES NERFINISHED ⓘ Data Encryption Standard NERFINISHED ⓘ GOST 28147-89 NERFINISHED ⓘ Twofish NERFINISHED ⓘ |
| usedIn | block cipher design ⓘ |
| variant |
Feistel-like network
NERFINISHED
ⓘ
generalized Feistel network ⓘ type-2 Feistel network ⓘ type-3 Feistel network ⓘ type-4 Feistel network ⓘ unbalanced Feistel network ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Subject: Feistel network Description of subject: A Feistel network is a symmetric structure for building block ciphers that splits data into halves and repeatedly applies round functions to achieve secure encryption and decryption.
Referenced by (6)
Full triples — surface form annotated when it differs from this entity's canonical label.