CryptoDB
Lai-Massey Scheme and Quasi-Feistel Networks
| Authors: | |
|---|---|
| Download: | |
| 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. |
BibTeX
@misc{eprint-2007-13627,
title={Lai-Massey Scheme and Quasi-Feistel Networks},
booktitle={IACR Eprint archive},
keywords={foundations / Lai-Massey scheme, Feistel network, Luby-Rackoff, block cipher design, pseudorandom function, indistinguishability},
url={http://eprint.iacr.org/2007/347},
note={ aaramyun@gmail.com 13760 received 4 Sep 2007},
author={Aaram Yun and Je Hong Park and Jooyoung Lee},
year=2007
}