Author:
Xu Shanjie,Da Qi,Guo Chun
Abstract
At EUROCRYPT 2015, Cogliati and Seurin proved that the 4-round Iterated Even-Mansour (IEM) cipher with Independent random Permutations and no key schedule EMIP4(k, u) = k⊕p4 ( k⊕p3 ( k⊕p2 (k⊕p1 (k⊕u)))) is sequentially indifferentiable from an ideal cipher, which implies chosen-key security in the sense of correlation intractability. In practice, however, blockciphers such as the AES typically employ the same permutation at each round. To bridge the gap, we prove that the 4-round IEM cipher EMSP[φ]p4 (k, u) = k4⊕p (k3⊕p (k2⊕p(k1⊕p(k0⊕u)))), whose round keys ki = φi(k) are derived using an affine permutation φ : {0, 1}n → {0, 1}n with certain properties, is sequentially indifferentiable from an ideal cipher. The function φ can be a linear orthomorphism, or φ(k) := k≫a for some fixed integer a using cyclic shift. To our knowledge, this is the first indifferentiability-type result for blockciphers using identical round functions.
Publisher
Universitatsbibliothek der Ruhr-Universitat Bochum
Subject
Applied Mathematics,Computational Mathematics,Computer Science Applications,Software
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Feistel Ciphers Based on a Single Primitive;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2024-08-01
2. On the sequential indifferentiability of the Lai–Massey construction;Designs, Codes and Cryptography;2024-02-17
3. Feistel Ciphers Based on a Single Primitive;Cryptography and Coding;2023-12-04