Cryptanalysis of Selected ARX-Based Block Ciphers

Abstract

The security of digital communication and information systems is mostly dependent on block ciphers. ARX-based ciphers are widely used due to their simplicity and efficiency. This paper provides an exhaustive cryptanalysis of a subset of ARX-based block ciphers, with particular emphasis on SIMON, SPECK, and IDEA. These ciphers need to be exposed for their weaknesses in algebraic attack resistance and cryptographic properties such as key sensitivity. In addition, we assess the resource utilization and speed of these ciphers, both of which are critical for practical implementation. SMT (Satisfiability Modulo Theories) framework is utilized to tackle constraint fulfillment problems based on first-order logic. The following cryptographic steps use SMT solvers: differential cryptanalysis, collision attack, pre-image attack, modular root-finding, and cryptographic primitive verification. We show that SMT solvers can solve block cipher cryptanalysis constraints. In a cryptanalytic attack, we convert block cipher boolean equations to Z3py. The proposed cryptanalysis method evaluates ARX cipher performance. This method recovers the partial secret key using plaintext and ciphertext pairs, partial key bits, and a predetermined number of rounds. To determine whether SIMON, SPECK, or IDEA are appropriate for distinct security requirements, we conducted a comparative analysis of the results and presented them in tabulated form. This research builds a better understanding of ARX-based block ciphers and allows us to develop more robust and efficient cryptographic algorithms to protect sensitive data in modern communication systems.

Keywords

• Block ciphers
• ARX ciphers
• cryptanalysis
• SMT solvers
• algebraic attacks