Addendum to Linear Cryptanalyses of Three AEADs with GIFT-128 as Underlying Primitives

Authors

  • Ling Sun Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University, Jinan, China; State Key Laboratory of Cryptology, P.O.Box 5159, Beijing, 100878, China; School of Cyber Science and Technology, Shandong University, Qingdao, China
  • Wei Wang Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University, Jinan, China; School of Cyber Science and Technology, Shandong University, Qingdao, China
  • Meiqin Wang Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University, Jinan, China; School of Cyber Science and Technology, Shandong University, Qingdao, China; Quan Cheng Shandong Laboratory, Jinan, China

DOI:

https://doi.org/10.46586/tosc.v2022.i1.212-219

Keywords:

Differential cryptanalysis, Linear cryptanalysis, GIFT-128

Abstract

In ToSC 2021(2), Sun et al. implemented an automatic search with the Boolean satisfiability problem (SAT) method on GIFT-128 and identified a 19-round linear approximation with the expected linear potential being 2−117.43, which is utilised to launch a 24-round attack on the cipher. In this addendum, we discover a new 19-round linear approximation with a lower expected linear potential. However, in the attack, one more round can be appended after the distinguisher. As a result, we improve the previous optimal linear attack by one round and put forward a 25-round linear attack. Given that the optimal differential attack on GIFT-128, for now, covers 27-round, the resistances of the cipher against differential and linear attacks still have a 2-round gap.

Downloads

Published

2022-03-11

Issue

Section

Articles

How to Cite

Addendum to Linear Cryptanalyses of Three AEADs with GIFT-128 as Underlying Primitives. (2022). IACR Transactions on Symmetric Cryptology, 2022(1), 212-219. https://doi.org/10.46586/tosc.v2022.i1.212-219