Score:1

Four round Feistel network using pseudo random round function

tn flag

I am solving a four-round Feistel network using pseudo-random round function is a strong pseudo-random function for security against adversaries, but I don't understand that how to solve I know 3 round.

Can you please explain the procedure?

I am assuming ${F : \{0,1\}^λ × \{0,1\}^λ → \{0,1\}^λ }$ be a secure PRF with in = out = λ, and define ${F^∗ : \{0,1\}^{4λ} × \{0,1\}^{2λ} → \{0,1\}^{2λ}}$

Then ${F^∗ }$is a secure strong PRP.

Fractalice avatar
in flag
How $F^*$ is defined? Why it maps $4\lambda+2\lambda$ bits into $2\lambda$ bits? Feistel network would map $2\lambda$ bits to $2\lambda$ bits.
Irad Nuriel avatar
lk flag
@Fractalice I think $F^*$ is a 4 rounds feistel network with $F$ as the round function, the $2λ$ is the input to the feistel network, and the $4λ$ is for round keys or something
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.