Paper 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.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- A minor revision of an IACR publication in FSE 2015
- Keywords
- hash functionblock cipherlinear cryptanalysisdistinguisherPRESENT
- Contact author(s)
- mmeh @ dtu dk
- History
- 2015-09-17: received
- Short URL
- https://ia.cr/2015/908
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2015/908,
author = {Martin M. Lauridsen and Christian Rechberger},
title = {Linear Distinguishers in the Key-less Setting: Application to PRESENT},
howpublished = {Cryptology ePrint Archive, Paper 2015/908},
year = {2015},
note = {\url{https://eprint.iacr.org/2015/908}},
url = {https://eprint.iacr.org/2015/908}
}
