Cryptology ePrint Archive: Report 2020/1089

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

Akinori Hosoyamada and María Naya-Plasencia and Yu Sasaki

Abstract: Limited birthday distinguishers (LBDs) are widely used tools for the cryptanalysis of cryptographic permutations. In this paper we propose LBDs on several variants of the sLiSCP permutation family that are building blocks of two round 2 candidates of the NIST lightweight standardization process: SPIX and SpoC. 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 middle part, called inbound, and we relax the external conditions in order to extend the previous 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, which shows that the known upper bounds are tight.

Category / Keywords: secret-key cryptography / limited birthday distinguisher, sLiSCP, permutation, NIST Lightweight cryptography, rebound attack

Original Publication (in the same form): IACR-FSE-2020

Date: received 10 Sep 2020, last revised 5 Mar 2021

Contact author: akinori hosoyamada bh at hco ntt co jp, maria naya_plasencia at inria fr, yu sasaki sk at hco ntt co jp, hosoyamada akinori at nagoya-u jp

Available format(s): PDF | BibTeX Citation

Note: Minor revision

Version: 20210305:163150 (All versions of this report)

Short URL: ia.cr/2020/1089


[ Cryptology ePrint archive ]