Bit-wise Cryptanalysis on AND-RX Permutation Friet-PC
Bit-wise Cryptanalysis on AND-RX Permutation Friet-PC
复制标题
DOI：
10.1016/j.jisa.2021.102860
复制
发表时间：
2021-06
期刊：
影响因子：
--
通讯作者：
Ryoma Ito;Rentaro Shiba;Kosei Sakamoto;Fukang Liu;Takanori Isobe
中科院分区：
文献类型：
--
作者：
Ryoma Ito;Rentaro Shiba;Kosei Sakamoto;Fukang Liu;Takanori Isobe
针对AND-RX置换Friet-PC提出了3种比特密码分析攻击向量，包括旋转攻击、比特差分攻击和零和区分攻击，并在一个轻量级认证加密方案Friet中实现。首先，我们提出了一个通用的旋转攻击AND-RX密码轮常数的过程。通过对Friet-PC的攻击，我们可以构建一个8轮的旋转攻击的时间复杂度为2 102。接下来，我们探索单位和双位差分偏置，这是受Salsa和ChaCha现有研究的启发，并观察2− 9的最佳位差分偏置。552.这种偏见使我们能够实际上构建一个9轮逐位差分卷积的时间复杂度为2 - 20。044.最后，我们构造了13轮，15轮和17轮零和乘法器，时间复杂度分别为2 31，2 63和2 127。总结我们的研究，我们应用三种攻击向量的按位密码分析的Friet-PC和显示其优越性作为有效的攻击AND-RX密码。
This paper presents three attack vectors of bit-wise cryptanalysis including rotational, bit-wise differential, and zero-sum distinguishing attacks on the AND-RX permutation Friet-PC, which is implemented in a lightweight authenticated encryption scheme Friet. First, we propose a generic procedure for a rotational attack on AND-RX cipher with round constants. By applying the proposed attack to Friet-PC, we can construct an 8-round rotational distinguisher with a time complexity of 2 102. Next, we explore single-and dual-bit differential biases, which are inspired by the existing study on Salsa and ChaCha, and observe the best bit-wise differential bias with 2− 9. 552. This bias allows us to practically construct a 9-round bit-wise differential distinguisher with a time complexity of 2 20. 044. Finally, we construct 13-, 15-, and 17-round zero-sum distinguishers with time complexities of 2 31, 2 63, and 2 127, respectively. To summarize our study, we apply three attack vectors of bit-wise cryptanalysis to Friet-PC and show their superiority as effective attacks on AND-RX ciphers.