Welcome to the resource topic for 2007/449
Title:
Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
Authors: Jacques Patarin, Valérie Nachef, Côme Berbain
Abstract:\begin{abstract} Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k-1)n bits. At each round, all the bits except n bits are changed by using a function that depends only on these n bits. C.S.Jutla \cite{Jut} investigated such schemes, which he denotes by F^d_k, where d is the number of rounds. In this paper, we describe novel Known Plaintext Attacks (KPA) and Non Adaptive Chosen Plaintext Attacks (CPA-1) against these schemes. With these attacks we will often be able to improve the result of C.S.Jutla. We also give precise formulas for the complexity of our attacks in d, k and n. \end{abstract}
ePrint: https://eprint.iacr.org/2007/449
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .