Improved Attacks on sLiSCP Permutation and Tight Bound of Limited Birthday Distinguishers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IACR Transactions on Symmetric Cryptology Year : 2020

Improved Attacks on sLiSCP Permutation and Tight Bound of Limited Birthday Distinguishers

Abstract

Limited birthday distinguishers (LBDs) are widely used tools for thecryptanalysis of cryptographic permutations. In this paper we propose LBDs onseveral variants of thesLiSCPpermutation family that are building blocks of tworound 2 candidates of the NIST lightweight standardization process:SpixandSpoC.We improve the number of steps with respect to the previously known best results,that used rebound attack. We improve the techniques used for solving the middlepart, called inbound, and we relax the external conditions in order to extend theprevious attacks.The lower bound of the complexity of LBDs has been proved only against functions.In this paper, we prove for the first time the bound against permutations, whichshows that the known upper bounds are tight.

Dates and versions

hal-03135330 , version 1 (08-02-2021)

Identifiers

Cite

Akinori Hosoyamada, María Naya-Plasencia, Yu Sasaki. Improved Attacks on sLiSCP Permutation and Tight Bound of Limited Birthday Distinguishers. IACR Transactions on Symmetric Cryptology, 2020, 2020 (4), pp.147-172. ⟨10.46586/tosc.v2020.i4.147-172⟩. ⟨hal-03135330⟩

Collections

INRIA INRIA2
37 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More