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

Martin Mehl Lauridsen; Christian Rechberger

doi:10.1007/978-3-662-48116-5_11

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

Martin Mehl Lauridsen, Christian Rechberger

Department of Applied Mathematics and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

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.

Original language	English
Title of host publication	Revised Selected Papers of the 22nd International Workshop on Fast Software Encryption (FSE 2015)
Editors	Gregor Leander
Publisher	Springer
Publication date	2015
Pages	217-240
ISBN (Print)	978-3-662-48115-8
ISBN (Electronic)	978-3-662-48116-5
DOIs	https://doi.org/10.1007/978-3-662-48116-5_11
Publication status	Published - 2015
Event	22nd International Workshop on Fast Software Encryption (FSE 2015) - Istanbul, Turkey Duration: 8 Mar 2015 → 11 Mar 2015 Conference number: 22 http://www.lightsec.org/fse2015/

Workshop

Workshop	22nd International Workshop on Fast Software Encryption (FSE 2015)
Number	22
Country/Territory	Turkey
City	Istanbul
Period	08/03/2015 → 11/03/2015
Internet address	http://www.lightsec.org/fse2015/

Series	Lecture Notes in Computer Science
Volume	9054
ISSN	0302-9743

Keywords

Hash function
Block cipher
Linear cryptanalysis
Distinguisher
PRESENT

Access to Document

10.1007/978-3-662-48116-5_11

OpenUrl availability

Full text

Cite this

@inproceedings{2d8fe7348d054e949bdfe4aa1eecec00,

title = "Linear Distinguishers in the Key-less Setting: Application to PRESENT",

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.",

keywords = "Hash function, Block cipher, Linear cryptanalysis, Distinguisher, PRESENT",

author = "Lauridsen, {Martin Mehl} and Christian Rechberger",

year = "2015",

doi = "10.1007/978-3-662-48116-5_11",

language = "English",

isbn = "978-3-662-48115-8",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "217--240",

editor = "Leander, {Gregor }",

booktitle = "Revised Selected Papers of the 22nd International Workshop on Fast Software Encryption (FSE 2015)",

note = "22nd International Workshop on Fast Software Encryption (FSE 2015), FSE 2015 ; Conference date: 08-03-2015 Through 11-03-2015",

url = "http://www.lightsec.org/fse2015/",

}

Lauridsen, MM & Rechberger, C 2015, Linear Distinguishers in the Key-less Setting: Application to PRESENT. in G Leander (ed.), Revised Selected Papers of the 22nd International Workshop on Fast Software Encryption (FSE 2015). Springer, Lecture Notes in Computer Science, vol. 9054, pp. 217-240, 22nd International Workshop on Fast Software Encryption (FSE 2015), Istanbul, Turkey, 08/03/2015. https://doi.org/10.1007/978-3-662-48116-5_11

Linear Distinguishers in the Key-less Setting: Application to PRESENT. / Lauridsen, Martin Mehl; Rechberger, Christian.
Revised Selected Papers of the 22nd International Workshop on Fast Software Encryption (FSE 2015). ed. / Gregor Leander. Springer, 2015. p. 217-240 (Lecture Notes in Computer Science, Vol. 9054).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

TY - GEN

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

AU - Lauridsen, Martin Mehl

AU - Rechberger, Christian

N1 - Conference code: 22

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

KW - Hash function

KW - Block cipher

KW - Linear cryptanalysis

KW - Distinguisher

KW - PRESENT

U2 - 10.1007/978-3-662-48116-5_11

DO - 10.1007/978-3-662-48116-5_11

M3 - Article in proceedings

SN - 978-3-662-48115-8

T3 - Lecture Notes in Computer Science

SP - 217

EP - 240

BT - Revised Selected Papers of the 22nd International Workshop on Fast Software Encryption (FSE 2015)

A2 - Leander, Gregor

PB - Springer

T2 - 22nd International Workshop on Fast Software Encryption (FSE 2015)

Y2 - 8 March 2015 through 11 March 2015

ER -

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

Abstract

Workshop

Keywords

Access to Document

OpenUrl availability

Fingerprint

Cite this