Paper 2007/347
Lai-Massey Scheme and Quasi-Feistel Networks
Aaram Yun, Je Hong Park, and Jooyoung Lee
Abstract
We introduce the notion of quasi-Feistel network, which is generalization of the Feistel network, and contains the Lai-Massey scheme as an instance. We show that some of the works on the Feistel network, including the works of Luby-Rackoff, Patarin, Naor-Reingold and Piret, can be naturally extended to our setting. This gives a new proof for theorems of Vaudenay on the security of the Lai-Massey scheme, and also introduces for Lai-Massey a new construction of pseudorandom permutation, analoguous to the construction of Naor-Reingold using pairwise independent permutations. Also, we prove the birthday security of $(2b-1)$- and $(3b-2)$-round unbalanced quasi-Feistel networks with b branches against CPA and CPCA attacks, respectively. This answers an unsolved problem pointed out by Patarin et al.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Lai-Massey schemeFeistel networkLuby-Rackoffblock cipher designpseudorandom functionindistinguishability
- Contact author(s)
- aaramyun @ gmail com
- History
- 2007-09-05: received
- Short URL
- https://ia.cr/2007/347
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/347,
author = {Aaram Yun and Je Hong Park and Jooyoung Lee},
title = {Lai-Massey Scheme and Quasi-Feistel Networks},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/347},
year = {2007},
url = {https://eprint.iacr.org/2007/347}
}
