首页>
外文会议>Selected Areas in Cryptography
>A Strategy for Constructing Fast Round Functions with Practical Security Against Differential and Linear Cryptanalysis
【24h】
A Strategy for Constructing Fast Round Functions with Practical Security Against Differential and Linear Cryptanalysis
In this paper, we study a strategy for constructing fast and practically secure round functions that yield sufficiently small values of the maximum differential and linear probabilities p, q. We consider mn-bit round functions with 2-round SPN structure for Feistel ciphers. In this strategy, we regard a linear transformation layer as an n x n matrix P over {0,1}. We describe the relationship between the matrix representation and the actual construction of the linear transformation layer. We propose a search algorithm for constructing the optimal linear transformation layer by using the matrix representation in order to minimize probabilities p, q as much possible. Furthermore, by this algorithm, we determine the optimal linear transformation layer that provides p ≤ p_s~5, q ≤ q_s~5 in the case of n = 8, where p_e, q_s denote the maximum differential and linear probabilities of s-box.
展开▼
机译:在本文中,我们研究了一种构建快速且实际上安全的舍入函数的策略,该函数可产生足够小的最大微分和线性概率p,q的值。对于Feistel密码,我们考虑具有2舍入SPN结构的mn位舍入函数。在这种策略中,我们将线性变换层视为{0,1}上的n x n矩阵P。我们描述了矩阵表示与线性变换层的实际构造之间的关系。我们提出了一种搜索算法,该算法通过使用矩阵表示来构造最佳线性变换层,以尽可能最大程度地降低概率p,q。此外,通过该算法,我们确定了在n = 8的情况下提供p≤p_s〜5,q≤q_s〜5的最佳线性变换层,其中p_e,q_s表示s-box的最大微分和线性概率。
展开▼