SAT vs. Substitution Boxes of DES like Ciphers

Stachowiak, Sylwia; Kurkowski, Mirosław; Sobon, Artur

doi:10.1109/wetice53228.2021.00032

Cited by 2 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Starting the cryptanalysis with the selected plaintext of the cipher, we first write a boolean formula that encodes the operation of the entire cipher in the way, which we presented in the Section 3 [13,14,20]. We convert the obtained formula to the DIMACS format.…”

Section: Cryptanalysis Proceduresmentioning

confidence: 99%

See 1 more Smart Citation

Partial mathematical modeling and analysis of the AES system

Stachowiak,

Kurkowski

2023

J. Appl. Math. Comput. Mech.

View full text Add to dashboard Cite

Many types of decision problems can be solved using mathematical modeling and analysis. Such techniques are also developed on the border of mathematical logic and computer science. A good example is the translation of the issues examined into the Satisfiability Problem (SAT) of a logical propositional formula. Unfortunately, this method is not always practical, considering the high computational complexity of solving the SAT problem. It often happens that in the studied cases, the encoding formulas contain even hundreds of thousands of clauses and propositional variables. However, even in these cases, modern SAT solvers can sometimes successfully solve these problems. This approach can be used to cryptanalyze some symmetric ciphers or parts/modifications. In this case, the encryption algorithm is first translated into a boolean formula. Then additional formulas are created to encode randomly selected plaintext and the key bits. Using the SAT solver; we can count the values of the ciphertext bits. Then, using the SAT solver again, we proceed to the cryptanalysis of the cipher with the selected plaintext and proper ciphertext, looking for the bits of the encryption key. In this paper, we will present the new results of how SAT techniques behave against representative fragments of the AES cipher, the current standard for symmetric encryption. We also compare the results obtained in this case by several SAT solvers. In addition, we present the results of the SAT-solver CryptoMiniSat obtained during the attack on the 1st round of the AES-128 cipher.

show abstract

Section: Cryptanalysis Proceduresmentioning

confidence: 99%

“…In our method, we do not describe the algorithm using algebraic equations nor do we encode them into boolean formulas. Instead, we use the direct boolean encoding of the encryption algorithm, as was done in the works of [13][14][15][16]. In this article, we describe how the SAT techniques for the AES cipher behave.…”

Section: Introductionmentioning

confidence: 99%