10-Round Feistel is Indifferentiable from an Ideal Cipher

Dana Dachman-Soled; Jonathan Katz; Aishwarya Thiruvengadam

Paper 2015/876 Original: eprint.iacr.org/2015/876 ↗

10-Round Feistel is Indifferentiable from an Ideal Cipher

Dana Dachman-Soled

Jonathan Katz

Aishwarya Thiruvengadam

Abstract

We revisit the question of constructing an ideal cipher from a random oracle. Coron et al.~(Journal of Cryptology, 2014) proved that a 14-round Feistel network using random, independent, keyed round functions is indifferentiable from an ideal cipher, thus demonstrating the feasibility of such a construction. Left unresolved is the best possible efficiency of the transformation. We improve upon the result of Coron et al.\ and show that 10 rounds suffice.

Metadata

Available format(s): PDF
Publication info: Preprint.
History: 2015-09-13: last updated; 2015-09-13: published
Short URL: https://ia.cr/2015/876
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2015/876,
      author = {Dana Dachman-Soled and Jonathan Katz and Aishwarya Thiruvengadam},
      title = {10-Round Feistel is Indifferentiable from an Ideal Cipher},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/876},
      year = {2015},
      url = {https://eprint.iacr.org/2015/876}
}