3-round Feistel is Not Superpseudorandom Over Any Group

Hector B.  Hougaard

Paper 2021/675

3-round Feistel is Not Superpseudorandom Over Any Group

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.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint. MINOR revision.
Keywords: Feistel non-abelian group pseudorandom
Contact author(s): hector @ cy2sec comm eng osaka-u ac jp
History: 2021-05-25: received
Short URL: https://ia.cr/2021/675
License: CC BY

BibTeX

@misc{cryptoeprint:2021/675,
      author = {Hector B.  Hougaard},
      title = {3-round Feistel is Not Superpseudorandom Over Any Group},
      howpublished = {Cryptology ePrint Archive, Paper 2021/675},
      year = {2021},
      note = {\url{https://eprint.iacr.org/2021/675}},
      url = {https://eprint.iacr.org/2021/675}
}