Please use this identifier to cite or link to this item:
Title: MILP modeling of matrix multiplication: cryptanalysis of KLEIN and PRINCE
Authors: İlter, M.B.
Selçuk, A.A.
Keywords: cryptanalysis
differential cryptanalysis
linear cryptanalysis
Integer programming
Lyapunov methods
Matrix algebra
Differential characteristic
Differential cryptanalysis
Linear characteristics
Linear cryptanalysis
MAtrix multiplication
Mixed integer linear
XOR operation
Publisher: Turkiye Klinikleri
Abstract: Mixed-integer linear programming (MILP) techniques are widely used in cryptanalysis, aiding in the discovery of optimal linear and differential characteristics. This paper delves into the analysis of block ciphers KLEIN and PRINCE using MILP, specifically calculating the best linear and differential characteristics for reduced-round versions. Both ciphers employ matrix multiplication in their diffusion layers, which we model using multiple XOR operations. To this end, we propose two novel MILP models for multiple XOR operations, which use fewer variables and constraints, proving to be more efficient than standard methods for XOR modeling. For differential cryptanalysis, we identify characteristics with a probability of 2−59 for 7 rounds of KLEIN and a probability of 2−56 for 7 rounds of PRINCE. In linear cryptanalysis, we identify characteristics with a bias of 2−27 for 6 rounds of KLEIN and a bias of 2−29 for 7 rounds of PRINCE. These results establish the best single-key differential and linear distinguishers for these ciphers in the literature. © TÜBİTAK.
ISSN: 1300-0632
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
TR Dizin İndeksli Yayınlar / TR Dizin Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record

CORE Recommender

Page view(s)

checked on Apr 15, 2024

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.