Catching the Fastest Boomerangs
In this paper we describe a new tool to search for boomerang distinguishers. One limitation of the MILP model of Liu et al. is that it handles only one round for the middle part while Song et al. have shown that dependencies could affect much more rounds, for instance up to 6 rounds for SKINNY. Thu...
Main Authors: | Stéphanie Delaune, Patrick Derbez, Mathieu Vavrille |
---|---|
Format: | Article |
Language: | English |
Published: |
Ruhr-Universität Bochum
2020-12-01
|
Series: | IACR Transactions on Symmetric Cryptology |
Subjects: | |
Online Access: | https://tosc.iacr.org/index.php/ToSC/article/view/8750 |
Similar Items
-
Catching the Fastest Boomerangs
by: Stéphanie Delaune, et al.
Published: (2020-12-01) -
Boomerang Connectivity Table Revisited. Application to SKINNY and AES
by: Ling Song, et al.
Published: (2019-03-01) -
On the Boomerang Uniformity of Cryptographic Sboxes
by: Christina Boura, et al.
Published: (2018-09-01) -
On the Feistel Counterpart of the Boomerang Connectivity Table
by: Hamid Boukerrou, et al.
Published: (2020-05-01) -
Improved Rectangle Attacks on SKINNY and CRAFT
by: Hosein Hadipour, et al.
Published: (2021-06-01)