Cryptology ePrint Archive: Report 2015/908

Linear Distinguishers in the Key-less Setting: Application to PRESENT

Martin M. Lauridsen and Christian Rechberger

Abstract: The application of the concept of linear cryptanalysis to the domain of key-less primitives is largely an open problem. In this paper we, for the first time, propose a model in which its application is meaningful for distinguishing block ciphers. Combining our model with ideas from message modification and rebound-like approaches, we initiate a study of cryptographic primitives with respect to this new attack vector and choose the lightweight block cipher PRESENT as an example target. This leads to known-key distinguishers over up to 27 rounds, whereas the best previous result is up to 18 rounds in the chosen-key model.

Category / Keywords: secret-key cryptography / hash function, block cipher, linear cryptanalysis, distinguisher, PRESENT

Original Publication (with minor differences): IACR-FSE-2015

Date: received 17 Sep 2015

Contact author: mmeh at dtu dk

Available format(s): PDF | BibTeX Citation

Version: 20150917:144201 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]