Score:3

Is it necessary for a round function $F$ in a Feistel cipher to be pseudorandom?

cn flag

I stumbled across this question where the questioner asked for specific requirements for the round function $F$ in a Feistel network so that the construction is secure. The answer explained that a pseudorandom function in a four round Feistel cipher is sufficient for it to achieve security.

Is that also necessarily the case? In other words, can a Feistel cipher be constructed with a round function that is not a PRF?

et flag
The Feistel circuit converts a PRF into a PRP. If not a PRF, what are you planning to have as F?
trivicious avatar
cn flag
@user93353 This is exactly the question, is there an F that is not a PRF but the Feistel network still gives a PRP?
kelalaka avatar
in flag
Could you explain what is _not a PRF_ for you? See Tiny Encryption Algorithm (TEA) that uses simple round operations and it is secure with sufficient rounds.
trivicious avatar
cn flag
@kelalaka I used PRF as defined by the rigorous mathematical definition. But if I understand TEA correctly, I think this is already a counter example. Thank you!
mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.