Book chapter · Conference paper
Linear Distinguishers in the Key-less Setting: Application to PRESENT
In
Lecture Notes in Computer Science
—
2015, pp. 217-240
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.
| Language: | English |
|---|---|
| Publisher: | Springer |
| Year: | 2015 |
| Pages: | 217-240 |
| Proceedings: | 22nd International Workshop on Fast Software Encryption (FSE 2015)International Conference on Fast Software Encryption |
| Series: | Lecture Notes in Computer Science |
| ISBN: | 3662481154 , 3662481162 , 9783662481158 and 9783662481165 |
| ISSN: | 16113349 and 03029743 |
| Types: | Book chapter and Conference paper |
| DOI: | 10.1007/978-3-662-48116-5_11 |
