Balanced Permutations Even–Mansour Ciphers
Department of Mathematics and Computer Science, The Open University of Israel, Raanana 4353701, Israel
Department of Mathematics, University of Haifa, Haifa 3498838, Israel
Intel Corporation, Israel Development Center, Haifa 31015, Israel
Indian Statistical Institute, Kolkata 700108, India
Author to whom correspondence should be addressed.
Academic Editor: Kwangjo Kim
Received: 2 February 2016 / Revised: 29 March 2016 / Accepted: 30 March 2016 / Published: 1 April 2016
-rounds Even–Mansour block cipher is a generalization of the well known Even–Mansour block cipher to r
iterations. Attacks on this construction were described by Nikolić et al.
and Dinur et al.
. These attacks are only marginally better than brute force but are based on an interesting observation (due to Nikolić et al.
): for a “typical” permutation P
, the distribution of
is not uniform. This naturally raises the following question. Let us call permutations for which the distribution of
is uniformly “balanced” — is there a sufficiently large family of balanced permutations, and what is the security of the resulting Even–Mansour block cipher? We show how to generate families of balanced permutations from the Luby–Rackoff construction and use them to define a
-bit block cipher from the 2-round Even–Mansour scheme. We prove that this cipher is indistinguishable from a random permutation of
, for any adversary who has oracle access to the public permutations and to an encryption/decryption oracle, as long as the number of queries is
. As a practical example, we discuss the properties and the performance of a 256-bit block cipher that is based on our construction, and uses the Advanced Encryption Standard (AES), with a fixed key, as the public permutation.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Gilboa, S.; Gueron, S.; Nandi, M. Balanced Permutations Even–Mansour Ciphers. Cryptography 2017, 1, 2.
Gilboa S, Gueron S, Nandi M. Balanced Permutations Even–Mansour Ciphers. Cryptography. 2017; 1(1):2.
Gilboa, Shoni; Gueron, Shay; Nandi, Mridul. 2017. "Balanced Permutations Even–Mansour Ciphers." Cryptography 1, no. 1: 2.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
Multiple requests from the same IP address are counted as one view.