Complete SAT based cryptanalysis of RC5 cipher

Keeping the proper security level of ciphers used in communication networks is today a very important problem. Cryptanalysts ensure a constant need for improvement complexity and ciphers' security by trying to break them. Sometimes they do not instantly try to break the strongest version of the...

Full description

Permalink: http://skupni.nsk.hr/Record/nsk.NSK01001088887/Details
Matična publikacija: Journal of information and organizational sciences (Online)
44 (2020), 2 ; str. 365-382
Glavni autori: Soboń, Artur (Author), Kurkowski, Miroslaw, Stachowiak, Sylwia
Vrsta građe: e-članak
Jezik: eng
Predmet:
Online pristup: https://doi.org/10.31341/jios.44.2.10
Journal of information and organizational sciences (Online)
Hrčak
LEADER 02844naa a22003734i 4500
001 NSK01001088887
003 HR-ZaNSK
005 20210219114902.0
006 m d
007 cr||||||||||||
008 210201s2020 ci d |o |0|| ||eng
024 7 |2 doi  |a 10.31341/jios.44.2.10 
035 |a (HR-ZaNSK)001088887 
040 |a HR-ZaNSK  |b hrv  |c HR-ZaNSK  |e ppiak 
041 0 |a eng  |b eng 
042 |a croatica 
044 |a ci  |c hr 
080 1 |a 004  |2 2011 
100 1 |a Soboń, Artur  |4 aut  |9 HR-ZaNSK 
245 1 0 |a Complete SAT based cryptanalysis of RC5 cipher  |h [Elektronička građa] /  |c Artur Soboń, Mirosław Kurkowski, Sylwia Stachowiak. 
300 |b Graf. prikazi. 
504 |a Bibliografija: 24 jed. 
504 |a Abstract. 
520 |a Keeping the proper security level of ciphers used in communication networks is today a very important problem. Cryptanalysts ensure a constant need for improvement complexity and ciphers' security by trying to break them. Sometimes they do not instantly try to break the strongest version of the cipher, but they are looking for weaknesses by splitting it and independently checking all algorithm components. Often cryptanalysts also attempt to break cipher by using its weaker version or configuration. There are plenty of mechanisms and approaches to cryptanalysis to solve those challenges. One of them is SAT-based method, that uses logical encoding. In this article, we present our wide analysis and new experimental results of SAT-based, direct cryptanalysis of the RC5 cipher. To perform such actions on the given cipher, we initially create a propositional logical formula, that describes and represents the entire RC5 algorithm. The second step is to randomly generate key and plaintext. Then we determine the ciphertext. In the last step of our computations, we use SAT-solvers. They are particularly designed tools for checking the satisfiability of the Boolean formulas. In our research, we make cryptanalysis of RC5 cipher in the case with plaintext and ciphertext. To get the best result, we compared many SAT-solvers and choose several. Some of them were relatively old, but still very efficient and some were modern and popular. 
653 0 |a Kriptoanaliza  |a Komunikacijske mreže  |a Šifre  |a Simetrična kriptografija  |a Sigurnost 
700 1 |a Kurkowski, Miroslaw  |4 aut  |9 HR-ZaNSK 
700 1 |a Stachowiak, Sylwia  |4 aut  |9 HR-ZaNSK 
773 0 |t Journal of information and organizational sciences (Online)  |x 1846-9418  |g 44 (2020), 2 ; str. 365-382  |w nsk.(HR-ZaNSK)000672813 
981 |b Be2020  |b B02/20 
998 |b tino2102 
856 4 0 |u https://doi.org/10.31341/jios.44.2.10 
856 4 0 |u https://jios.foi.hr/index.php/jios/article/view/1438  |y Journal of information and organizational sciences (Online) 
856 4 0 |u https://hrcak.srce.hr/247576  |y Hrčak 
856 4 1 |y Digitalna.nsk.hr