@inproceedings{36677e5f02424c97a89ab37e05587fc7,
title = "Tighter security bound of MIBS block cipher against differential attack",
abstract = "Automatically calculating a lower bound of the number of differentially active S-boxes by mixed-integer linear programming (MILP) is a technique proposed by Mouha et al. in 2011 and it can significantly reduce the time spent on security evaluation of a cipher and decrease the possibility of human errors in cryptanalysis. In this paper, we apply the MILP method to analyze the security of MIBS, a lightweight block cipher proposed by Izadi et al. in 2009. By adding more constraints in the MILP problem, we get tighter lower bounds on the numbers of differentially active S-boxes in MIBS. We show that for MIBS, 18 rounds of iterations are sufficient to resist against single-key differential attack, and 39 rounds are secure against related-key differential cryptanalysis.",
keywords = "Active S-box, Differential attack, MIBS block cipher, Mixed-Integer linear programming",
author = "Xiaoshuang Ma and Lei Hu and Siwei Sun and Kexin Qiao and Jinyong Shan",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2014.; 8th International Conference on Network and System Security, NSS 2014 ; Conference date: 15-10-2014 Through 17-10-2014",
year = "2014",
doi = "10.1007/978-3-319-11698-3_41",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "518--525",
editor = "Au, {Man Ho} and Barbara Carminati and Kuo, {C.-C. Jay}",
booktitle = "Network and System Security - 8th International Conference, NSS 2014, Proceedings",
address = "Germany",
}