Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient

Yuanxi Dai, Yannick Seurin, John P. Steinberger, Aishwarya Thiruvengadam. Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient. In Jonathan Katz, Hovav Shacham, editors, Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part III. Volume 10403 of Lecture Notes in Computer Science, pages 524-555, Springer, 2017. [doi]

@inproceedings{DaiSST17-0,
  title = {Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient},
  author = {Yuanxi Dai and Yannick Seurin and John P. Steinberger and Aishwarya Thiruvengadam},
  year = {2017},
  doi = {10.1007/978-3-319-63697-9_18},
  url = {https://doi.org/10.1007/978-3-319-63697-9_18},
  researchr = {https://researchr.org/publication/DaiSST17-0},
  cites = {0},
  citedby = {0},
  pages = {524-555},
  booktitle = {Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part III},
  editor = {Jonathan Katz and Hovav Shacham},
  volume = {10403},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-63697-9},
}