ExamGecko
Question list
Search
Search

Related questions











Question 155 - 212-81 discussion

Report
Export

If the round function is a cryptographically secure pseudorandom function, then ___________ rounds is sufficient to make the block cipher a pseudorandom permutation.

A.
2
Answers
A.
2
B.
15
Answers
B.
15
C.
16
Answers
C.
16
D.
3
Answers
D.
3
Suggested answer: D

Explanation:

3

https://en.wikipedia.org/wiki/Feistel_cipher

Michael Luby and Charles Rackoff analyzed the Feistel cipher construction, and proved that if the round function is a cryptographically secure pseudorandom function, with Ki used as the seed, then 3 rounds are sufficient to make the block cipher a pseudorandom permutation, while 4 rounds are sufficient to make it a 'strong' pseudorandom permutation (which means that it remains pseudorandom even to an adversary who gets oracle access to its inverse permutation). Because of this very important result of Luby and Rackoff, Feistel ciphers are sometimes called Luby--Rackoff block ciphers.

asked 18/09/2024
Tracy Sampson
34 questions
User
Your answer:
0 comments
Sorted by

Leave a comment first