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?

  • $\begingroup$ The Feistel circuit converts a PRF into a PRP. If not a PRF, what are you planning to have as F? $\endgroup$
    – user93353
    Jan 13 at 16:15
  • $\begingroup$ @user93353 This is exactly the question, is there an F that is not a PRF but the Feistel network still gives a PRP? $\endgroup$
    – trivicious
    Jan 13 at 16:26
  • $\begingroup$ 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. $\endgroup$
    – kelalaka
    Jan 13 at 19:49
  • $\begingroup$ @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! $\endgroup$
    – trivicious
    Jan 16 at 10:17

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.