Welcome to the resource topic for 2021/675
Title:
3-round Feistel is Not Superpseudorandom Over Any Group
Authors: Hector B. Hougaard
Abstract:Luby and Rackoff used a Feistel cipher over bit strings to construct a pseudorandom permutation from pseudorandom functions in 1988 and in 2002, Patel, Ramzan, and Sundaram generalized the construction to arbitrary abelian groups. They showed that the 3-round Feistel cipher is not superpseudorandom over abelian groups but left as an open problem a proof for non-abelian groups. We give this proof. Keywords: Feistel, non-abelian group, pseudorandom.
ePrint: https://eprint.iacr.org/2021/675
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .