[DKT16] 10-Round Feistel is Indifferentiable from an Ideal Cipher

Authors: Dana Dachman-Soled, Jonathan Katz, Aishwarya Thiruvengadam | Venue: EUROCRYPT 2016 | Source

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.

BibTeX

@Inproceedings{EC:DacKatThi16,
  author = {Dana {Dachman-Soled} and Jonathan Katz and Aishwarya Thiruvengadam},
  title = {10-Round {Feistel} is Indifferentiable from an Ideal Cipher},
  pages = {649--678},
  editor = {Marc Fischlin and Jean-S{\'{e}}bastien Coron},
  booktitle = {Advances in Cryptology -- {EUROCRYPT}~2016, Part~II},
  volume = {9666},
  series = {Lecture Notes in Computer Science},
  address = {Vienna, Austria},
  month = {may~8--12},
  publisher = {Springer Berlin Heidelberg, Germany},
  year = {2016},
  doi = {10.1007/978-3-662-49896-5_23},
}