Cryptology ePrint Archive: Report 2020/392

An argument on the security of LRBC, a recently proposed lightweight block cipher

Sadegh Sadeghi and Nasour Bagheri

Abstract: LRBC is a new lightweight block cipher that has been proposed for resource-constrained IoT devices. The cipher is claimed to be secure against differential cryptanalysis and linear cryptanalysis. However, beside short state length which is only 16-bits, the structures of the cipher only use the linear operations, the its s-boxes, and this is a reason why the cipher is completely insecure against the mentioned attacks. we present a few examples to show that. Also, we show that the round function of LRBC has some structural problem and even if we fix them the cipher does not provide complete diffusion. Hence, even with replacement of the cipher s-boxes with proper s-boxes, the problem will not be fixed and it is possible to provide deterministic distinguisher for any number of round of the cipher. In addition, we show that for any fixed key, it is possible to create a full code book for the cipher with the complexity of $2^{n/2}$, which should be compared with $2^{n}$ for any secure $n$-bit block cipher.

Category / Keywords: secret-key cryptography / Differential Cryptanalysis, Linear Cryptanalysis, Full-code-book, LRBC

Date: received 6 Apr 2020

Contact author: s sadeghi khu at gmail com,na bagheri@gmail com

Available format(s): PDF | BibTeX Citation

Version: 20200409:124720 (All versions of this report)

Short URL: ia.cr/2020/392


[ Cryptology ePrint archive ]