@inproceedings{32d758a9442247ae98915deff571e55c,
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 1/2+2-29.04. 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",
year = "2019",
month = may,
day = "19",
doi = "10.1007/978-3-030-20951-3_2",
language = "English",
isbn = "978-3-030-20950-6",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
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",
note = "International Symposium on Cyber Security Cryptography and Machine Learning (CSCML 2019) ; Conference date: 27-06-2019 Through 28-06-2019",
}