TY - GEN
T1 - Impossible Differential Analysis on 8-Round PRINCE
AU - Ding, Yaoling
AU - Jia, Keting
AU - Wang, An
AU - Shi, Ying
N1 - Publisher Copyright:
© 2021, Springer Nature Singapore Pte Ltd.
PY - 2021
Y1 - 2021
N2 - PRINCE is a lightweight block cipher, which was proposed by Borghoff et al. in Asiacrypt 2012. Various cryptanalytic techniques have been employed to evaluate the security of PRINCE. In 2017, Ding et al. constructed a 4-round impossible differential based on some observations on M′ operation and launched impossible differential attacks on 6- and 7-round PRINCE and the underlying PRINCEcore. In this paper, we explore the differential distribution table (DDT) of the S-box employed in PRINCE and construct a more detailed DDT which contains the input/output values corresponding to each differential. Taking advantage of the table, we compute the subkeys instead of guessing them. With this technique, we extend the impossible differential attacks of PRINCE and PRINCEcore to eight rounds. The corresponding computational and complexities are 110.7 and 62.26 encryptions, respectively, which are much less than exhaustive search. And the data complexities are 64 and 60 chosen plaintexts, respectively.
AB - PRINCE is a lightweight block cipher, which was proposed by Borghoff et al. in Asiacrypt 2012. Various cryptanalytic techniques have been employed to evaluate the security of PRINCE. In 2017, Ding et al. constructed a 4-round impossible differential based on some observations on M′ operation and launched impossible differential attacks on 6- and 7-round PRINCE and the underlying PRINCEcore. In this paper, we explore the differential distribution table (DDT) of the S-box employed in PRINCE and construct a more detailed DDT which contains the input/output values corresponding to each differential. Taking advantage of the table, we compute the subkeys instead of guessing them. With this technique, we extend the impossible differential attacks of PRINCE and PRINCEcore to eight rounds. The corresponding computational and complexities are 110.7 and 62.26 encryptions, respectively, which are much less than exhaustive search. And the data complexities are 64 and 60 chosen plaintexts, respectively.
KW - Impossible differential
KW - M′ operation
KW - PRINCE
KW - S-box
UR - http://www.scopus.com/inward/record.url?scp=85088292731&partnerID=8YFLogxK
U2 - 10.1007/978-981-15-3753-0_37
DO - 10.1007/978-981-15-3753-0_37
M3 - Conference contribution
AN - SCOPUS:85088292731
SN - 9789811537523
T3 - Advances in Intelligent Systems and Computing
SP - 383
EP - 395
BT - Proceedings of the 9th International Conference on Computer Engineering and Networks, CENet2019
A2 - Liu, Qi
A2 - Liu, Xiaodong
A2 - Li, Lang
A2 - Zhao, Hui-Huang
A2 - Zhou, Huiyu
PB - Springer
T2 - 9th International Conference on Computer Engineering and Networks, CENet2019
Y2 - 18 October 2019 through 20 October 2019
ER -