Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata
Contributor : María Naya-Plasencia Connect in order to contact the contributor
Submitted on : Monday, February 8, 2021 - 8:45:52 PM
Last modification on : Friday, January 21, 2022 - 3:23:15 AM

Links full text




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, Ruhr Universität Bochum, 2020, 2020 (4), pp.147-172. ⟨10.46586/tosc.v2020.i4.147-172⟩. ⟨hal-03135330⟩



Les métriques sont temporairement indisponibles