Linear cryptanalysis reduced round of piccolo-80

Tomer Ashur; Orr Dunkelman; Nael Masalha

doi:10.1007/978-3-030-20951-3_2

Linear cryptanalysis reduced round of piccolo-80

Tomer Ashur, Orr Dunkelman, Nael Masalha

Department of Computer Science

University of Haifa

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

Abstract

Piccolo is a 64-bit lightweight block cipher suitable for constrained environments such as wireless sensor networks. In this paper we evaluate the security of Piccolo-80 against linear cryptanalysis, we present a 6-round linear approximation of Piccolo-80 with probability (formula presented). We use this approximation to attack 7-round Piccolo-80 (with whitening keys) with data complexity of 2⁶¹ known plaintexts and time complexity of 2⁶¹. Its extension to an 8-round attack merely increases the time complexity to 2⁷⁰. This is the best linear attack against Piccolo-80 and it is also applicable to Piccolo-128 as the difference between the two variates is only the number of rounds and the key schedule algorithm. Moreover, we show that the bias in the approximation of the F-function, in some cases, is related to the MSB of the input. We utilize this relation to efficiently extract the MSBs of the whitening keys in the first round.

Original language	American English
Title of host publication	Cyber Security Cryptography and Machine Learning - 3rd International Symposium, CSCML 2019, Proceedings
Editors	Shlomi Dolev, Danny Hendler, Sachin Lodha, Moti Yung
Publisher	Springer Verlag
Pages	16-32
Number of pages	17
ISBN (Print)	9783030209506
DOIs	https://doi.org/10.1007/978-3-030-20951-3_2
State	Published - 2019
Event	3rd International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2019 - Beer Sheva, Israel Duration: 27 Jun 2019 → 28 Jun 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11527 LNCS

Conference

Conference	3rd International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2019
Country/Territory	Israel
City	Beer Sheva
Period	27/06/19 → 28/06/19

Keywords

Linear cryptanalysis
Piccolo

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-030-20951-3_2

Cite this

Ashur, T., Dunkelman, O., & Masalha, N. (2019). Linear cryptanalysis reduced round of piccolo-80. In S. Dolev, D. Hendler, S. Lodha, & M. Yung (Eds.), Cyber Security Cryptography and Machine Learning - 3rd International Symposium, CSCML 2019, Proceedings (pp. 16-32). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11527 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-20951-3_2

Ashur, Tomer ; Dunkelman, Orr ; Masalha, Nael. / Linear cryptanalysis reduced round of piccolo-80. Cyber Security Cryptography and Machine Learning - 3rd International Symposium, CSCML 2019, Proceedings. editor / Shlomi Dolev ; Danny Hendler ; Sachin Lodha ; Moti Yung. Springer Verlag, 2019. pp. 16-32 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{44b18cdda09245c88f393e5472dc70fd,

title = "Linear cryptanalysis reduced round of piccolo-80",

abstract = "Piccolo is a 64-bit lightweight block cipher suitable for constrained environments such as wireless sensor networks. In this paper we evaluate the security of Piccolo-80 against linear cryptanalysis, we present a 6-round linear approximation of Piccolo-80 with probability (formula presented). We use this approximation to attack 7-round Piccolo-80 (with whitening keys) with data complexity of 261 known plaintexts and time complexity of 261. Its extension to an 8-round attack merely increases the time complexity to 270. This is the best linear attack against Piccolo-80 and it is also applicable to Piccolo-128 as the difference between the two variates is only the number of rounds and the key schedule algorithm. Moreover, we show that the bias in the approximation of the F-function, in some cases, is related to the MSB of the input. We utilize this relation to efficiently extract the MSBs of the whitening keys in the first round.",

keywords = "Linear cryptanalysis, Piccolo",

author = "Tomer Ashur and Orr Dunkelman and Nael Masalha",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2019.; 3rd International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2019 ; Conference date: 27-06-2019 Through 28-06-2019",

year = "2019",

doi = "10.1007/978-3-030-20951-3_2",

language = "American English",

isbn = "9783030209506",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "16--32",

editor = "Shlomi Dolev and Danny Hendler and Sachin Lodha and Moti Yung",

booktitle = "Cyber Security Cryptography and Machine Learning - 3rd International Symposium, CSCML 2019, Proceedings",

address = "Germany",

}

Ashur, T, Dunkelman, O & Masalha, N 2019, Linear cryptanalysis reduced round of piccolo-80. in S Dolev, D Hendler, S Lodha & M Yung (eds), Cyber Security Cryptography and Machine Learning - 3rd International Symposium, CSCML 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11527 LNCS, Springer Verlag, pp. 16-32, 3rd International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2019, Beer Sheva, Israel, 27/06/19. https://doi.org/10.1007/978-3-030-20951-3_2

Linear cryptanalysis reduced round of piccolo-80. / Ashur, Tomer; Dunkelman, Orr; Masalha, Nael.
Cyber Security Cryptography and Machine Learning - 3rd International Symposium, CSCML 2019, Proceedings. ed. / Shlomi Dolev; Danny Hendler; Sachin Lodha; Moti Yung. Springer Verlag, 2019. p. 16-32 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11527 LNCS).

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

TY - GEN

T1 - Linear cryptanalysis reduced round of piccolo-80

AU - Ashur, Tomer

AU - Dunkelman, Orr

AU - Masalha, Nael

N1 - Publisher Copyright: © Springer Nature Switzerland AG 2019.

PY - 2019

Y1 - 2019

N2 - Piccolo is a 64-bit lightweight block cipher suitable for constrained environments such as wireless sensor networks. In this paper we evaluate the security of Piccolo-80 against linear cryptanalysis, we present a 6-round linear approximation of Piccolo-80 with probability (formula presented). We use this approximation to attack 7-round Piccolo-80 (with whitening keys) with data complexity of 261 known plaintexts and time complexity of 261. Its extension to an 8-round attack merely increases the time complexity to 270. This is the best linear attack against Piccolo-80 and it is also applicable to Piccolo-128 as the difference between the two variates is only the number of rounds and the key schedule algorithm. Moreover, we show that the bias in the approximation of the F-function, in some cases, is related to the MSB of the input. We utilize this relation to efficiently extract the MSBs of the whitening keys in the first round.

AB - Piccolo is a 64-bit lightweight block cipher suitable for constrained environments such as wireless sensor networks. In this paper we evaluate the security of Piccolo-80 against linear cryptanalysis, we present a 6-round linear approximation of Piccolo-80 with probability (formula presented). We use this approximation to attack 7-round Piccolo-80 (with whitening keys) with data complexity of 261 known plaintexts and time complexity of 261. Its extension to an 8-round attack merely increases the time complexity to 270. This is the best linear attack against Piccolo-80 and it is also applicable to Piccolo-128 as the difference between the two variates is only the number of rounds and the key schedule algorithm. Moreover, we show that the bias in the approximation of the F-function, in some cases, is related to the MSB of the input. We utilize this relation to efficiently extract the MSBs of the whitening keys in the first round.

KW - Linear cryptanalysis

KW - Piccolo

UR - http://www.scopus.com/inward/record.url?scp=85068234760&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-20951-3_2

DO - 10.1007/978-3-030-20951-3_2

M3 - Conference contribution

SN - 9783030209506

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 16

EP - 32

BT - Cyber Security Cryptography and Machine Learning - 3rd International Symposium, CSCML 2019, Proceedings

A2 - Dolev, Shlomi

A2 - Hendler, Danny

A2 - Lodha, Sachin

A2 - Yung, Moti

PB - Springer Verlag

T2 - 3rd International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2019

Y2 - 27 June 2019 through 28 June 2019

ER -

Ashur T, Dunkelman O, Masalha N. Linear cryptanalysis reduced round of piccolo-80. In Dolev S, Hendler D, Lodha S, Yung M, editors, Cyber Security Cryptography and Machine Learning - 3rd International Symposium, CSCML 2019, Proceedings. Springer Verlag. 2019. p. 16-32. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-20951-3_2

Linear cryptanalysis reduced round of piccolo-80

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this