Quantum Generic Attacks on Feistel Schemes
Quantum Physics
2017-02-28 v3
Abstract
The Feistel scheme is an important structure in the block ciphers. The security of the Feistel scheme is related to distinguishability with a random permutation. In this paper, efficient quantum algorithms for distinguishing classical 3,4-round and unbalanced Feistel scheme with contracting functions from random permutation are proposed. Our algorithms realize an exponential speed-up over classical algorithms for these problems. Furthermore, the method presented in this paper can also be used to consider unbalanced Feistel schemes with expanding functions.
Cite
@article{arxiv.1010.1624,
title = {Quantum Generic Attacks on Feistel Schemes},
author = {Hong Wang and Zhi Ma},
journal= {arXiv preprint arXiv:1010.1624},
year = {2017}
}
Comments
This paper has been withdrawn by the author due to a crucial error in Algorithm 1