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

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...

Full description

Bibliographic Details
Main Authors: Sun, L. (Author), Wang, M. (Author), Wang, W. (Author)
Format: Article
Language:English
Published: Ruhr-Universitat Bochum 2022
Subjects:
Online Access:View Fulltext in Publisher
LEADER 01490nam a2200193Ia 4500
001 10.46586-TOSC.V2022.I1.212-219
008 220425s2022 CNT 000 0 und d
020 |a 2519173X (ISSN) 
245 1 0 |a Addendum to Linear Cryptanalyses of Three AEADs with GIFT-128 as Underlying Primitives 
260 0 |b Ruhr-Universitat Bochum  |c 2022 
856 |z View Fulltext in Publisher  |u https://doi.org/10.46586/TOSC.V2022.I1.212-219 
520 3 |a 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. © 2022, Ruhr-Universitat Bochum. All rights reserved. 
650 0 4 |a Differential cryptanalysis 
650 0 4 |a GIFT-128 
650 0 4 |a Linear cryptanalysis 
700 1 |a Sun, L.  |e author 
700 1 |a Wang, M.  |e author 
700 1 |a Wang, W.  |e author 
773 |t IACR Transactions on Symmetric Cryptology