Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование
Application of the distinguishing attack to lightweight block ciphers. / Ryabko, Boris; Soskov, Aleksandr.
Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017. Institute of Electrical and Electronics Engineers Inc., 2017. стр. 338-341 8109901.Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование
}
TY - GEN
T1 - Application of the distinguishing attack to lightweight block ciphers
AU - Ryabko, Boris
AU - Soskov, Aleksandr
N1 - Publisher Copyright: © 2017 IEEE.
PY - 2017/11/14
Y1 - 2017/11/14
N2 - By definition, a distinguishing attack is any test that allows distinguishing the encrypted data from random data and modern symmetric-key ciphers must be immune to such an attack. In other words, modern block ciphers are designed to have ciphertext indistinguishability. If an algorithm that can distinguish the cipher output from random faster than a brute force search is found, then that is considered a break of the cipher. We applied the distinguishing attack to modern lightweight block ciphers Speck, Simon, Simeck, HIGHT and LEA using statistical test 'Book Stack'. We experimentally found a minimal number of rounds where encrypted data looked like random bit-sequence. It is shown, that this number of rounds varies significantly for different ciphers. In particular, our experiments and estimations show that cipher Simeck48/96 is not immune to distinguishing attack.
AB - By definition, a distinguishing attack is any test that allows distinguishing the encrypted data from random data and modern symmetric-key ciphers must be immune to such an attack. In other words, modern block ciphers are designed to have ciphertext indistinguishability. If an algorithm that can distinguish the cipher output from random faster than a brute force search is found, then that is considered a break of the cipher. We applied the distinguishing attack to modern lightweight block ciphers Speck, Simon, Simeck, HIGHT and LEA using statistical test 'Book Stack'. We experimentally found a minimal number of rounds where encrypted data looked like random bit-sequence. It is shown, that this number of rounds varies significantly for different ciphers. In particular, our experiments and estimations show that cipher Simeck48/96 is not immune to distinguishing attack.
UR - http://www.scopus.com/inward/record.url?scp=85040515800&partnerID=8YFLogxK
U2 - 10.1109/SIBIRCON.2017.8109901
DO - 10.1109/SIBIRCON.2017.8109901
M3 - Conference contribution
AN - SCOPUS:85040515800
SP - 338
EP - 341
BT - Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017
Y2 - 18 September 2017 through 22 September 2017
ER -
ID: 9133424