Orthros: A Low-Latency PRF
Orthros: A Low-Latency PRF
复制标题
DOI：
10.46586/tosc.v2021.i1.37-77
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
S. Banik;Takanori Isobe;Fukang Liu;Kazuhiko Minematsu;Kosei Sakamoto
中科院分区：
文献类型：
--
作者：
S. Banik;Takanori Isobe;Fukang Liu;Kazuhiko Minematsu;Kosei Sakamoto
我们出现了一个128位块的pseudorandom函数。但是，低能块密码，我们对其进行了彻底的修改，以减少延迟，并在少量的回合中引入不同的回合以提高加密强度。例如，在使用STM 90nm库中，Orthros的最小延迟约为2.4 ns，而Prince，Midori-128和Qarma9-128-σ0实现2.56 NS，4.10 ns，4.38 ns。
We present Orthros, a 128-bit block pseudorandom function. It is designed with primary focus on latency of fully unrolled circuits. For this purpose, we adopt a parallel structure comprising two keyed permutations. The round function of each permutation is similar to Midori, a low-energy block cipher, however we thoroughly revise it to reduce latency, and introduce different rounds to significantly improve cryptographic strength in a small number of rounds. We provide a comprehensive, dedicated security analysis. For hardware implementation, Orthros achieves the lowest latency among the state-of-the-art low-latency primitives. For example, using the STM 90nm library, Orthros achieves a minimum latency of around 2.4 ns, while other constructions like PRINCE, Midori-128 and QARMA9-128-σ0 achieve 2.56 ns, 4.10 ns, 4.38 ns respectively.