Paper 2020/1089

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

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


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.

Note: Minor revision

Available format(s)
Secret-key cryptography
Publication info
Published by the IACR in FSE 2020
limited birthday distinguishersLiSCPpermutationNIST Lightweight cryptographyrebound attack
Contact author(s)
akinori hosoyamada bh @ hco ntt co jp
maria naya_plasencia @ inria fr
yu sasaki sk @ hco ntt co jp
hosoyamada akinori @ nagoya-u jp
2021-03-05: last of 3 revisions
2020-09-15: received
See all versions
Short URL
Creative Commons Attribution


      author = {Akinori Hosoyamada and María Naya-Plasencia and Yu Sasaki},
      title = {Improved Attacks on sLiSCP Permutation and Tight Bound of Limited Birthday Distinguishers},
      howpublished = {Cryptology ePrint Archive, Paper 2020/1089},
      year = {2020},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.