Geodesic
Solving the problem of Boolean satisfiability for estimating the security of block ciphers Magma and PRESENT to algebraic cryptanalysis
Prikladnaya Diskretnaya Matematika. Supplement, no. 10 (2017), pp. 62-64

Voir la notice de l'article provenant de la source Math-Net.Ru

Some results of experimental investigating algorithms for cryptanalysis of ciphers Magma and PRESENT are presented. Algorithms under investigation solve the systems of Boolean equations of these ciphers by known methods – SAT and XL. The ciphers under consideration have been taken with small numbers of rounds (3, 4 in PRESENT, 5,8 in Magma) and simplified S-boxes (identical, linearized in Magma). The experimental results (memory size, running time, number of addition operations) are presented in dependence on the numbers of plain/cipher texts, equations, unknowns, etc. For example, the $8$-round cipher Magma with 5376 equations, 2048 unknowns is analysed by a computer with the processor IntelCore i5 for 416.31 sec.
Keywords: cryptography, block ciphers, algorithm PRESENT, SAT-solver, SageMath, security estimation.
Mots-clés : algebraic cryptanalysis, algorithm Magma 
@article{PDMA_2017_10_a25,
     author = {L. K. Babenko and E. A. Maro},
     title = {Solving the problem of {Boolean} satisfiability for estimating the security of block ciphers {Magma} and {PRESENT} to algebraic cryptanalysis},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {62--64},
     publisher = {mathdoc},
     number = {10},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2017_10_a25/}
}
TY  - JOUR
AU  - L. K. Babenko
AU  - E. A. Maro
TI  - Solving the problem of Boolean satisfiability for estimating the security of block ciphers Magma and PRESENT to algebraic cryptanalysis
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2017
SP  - 62
EP  - 64
IS  - 10
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2017_10_a25/
LA  - ru
ID  - PDMA_2017_10_a25
ER  - 
%0 Journal Article
%A L. K. Babenko
%A E. A. Maro
%T Solving the problem of Boolean satisfiability for estimating the security of block ciphers Magma and PRESENT to algebraic cryptanalysis
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2017
%P 62-64
%N 10
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2017_10_a25/
%G ru
%F PDMA_2017_10_a25
L. K. Babenko; E. A. Maro. Solving the problem of Boolean satisfiability for estimating the security of block ciphers Magma and PRESENT to algebraic cryptanalysis. Prikladnaya Diskretnaya Matematika. Supplement, no. 10 (2017), pp. 62-64. http://geodesic.mathdoc.fr/item/PDMA_2017_10_a25/