Additional optimization of the guaranteed number of activations in $\mathsf{XS}$-circuits computation algorithm
Prikladnaya Diskretnaya Matematika. Supplement, no. 16 (2023), pp. 78-81.

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

We propose an additional optimization to the Guaranteed Number of Activations (GNA) computation algorithm. The main idea of this optimization is to replace linear dependence checks based on the matrix rank computations with suffix checks of paths corresponding to partitions in the search tree. Proposed algorithm has been implemented and is two times faster than the previous solution. Using an optimized version of the GNA computation algorithm, we carried out several computational experiments. As a result, we refuted several hypothesis and proposed a scalable $\mathsf{XS}$-circuit construction with an optimal GNA value.
Keywords: guaranteed number of activations, $\mathsf{XS}$-circuit, differential cryptanalysis.
@article{PDMA_2023_16_a19,
     author = {D. R. Parfenov and A. O. Bakharev},
     title = {Additional optimization of the guaranteed number of activations in $\mathsf{XS}$-circuits computation algorithm},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {78--81},
     publisher = {mathdoc},
     number = {16},
     year = {2023},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2023_16_a19/}
}
TY  - JOUR
AU  - D. R. Parfenov
AU  - A. O. Bakharev
TI  - Additional optimization of the guaranteed number of activations in $\mathsf{XS}$-circuits computation algorithm
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2023
SP  - 78
EP  - 81
IS  - 16
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2023_16_a19/
LA  - ru
ID  - PDMA_2023_16_a19
ER  - 
%0 Journal Article
%A D. R. Parfenov
%A A. O. Bakharev
%T Additional optimization of the guaranteed number of activations in $\mathsf{XS}$-circuits computation algorithm
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2023
%P 78-81
%N 16
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2023_16_a19/
%G ru
%F PDMA_2023_16_a19
D. R. Parfenov; A. O. Bakharev. Additional optimization of the guaranteed number of activations in $\mathsf{XS}$-circuits computation algorithm. Prikladnaya Diskretnaya Matematika. Supplement, no. 16 (2023), pp. 78-81. http://geodesic.mathdoc.fr/item/PDMA_2023_16_a19/

[1] Agievich S. V., “$\mathsf{XS}$-circuits in block ciphers”, Matem. vopr. kriptogr., 10:2 (2019), 7–30 | DOI | MR | Zbl

[2] Biham E. and Shamir A., “Differential cryptanalysis of DES-like cryptosystems”, J. Cryptology, 4:1 (1991), 3–72 | DOI | MR | Zbl

[3] Agievich S. V., “On the guaranteed number of activations in $\mathsf{XS}$-circuits”, Matem. vopr. kriptogr., 12:2 (2021), 7–20 | DOI | MR | Zbl

[4] Parfenov D. R., Bakharev A. O., Kutsenko A. V. i dr., “Svoistva $\mathsf{XS}$-skhem, svyazannye s garantirovannym chislom aktivatsii”, Prikladnaya diskretnaya matematika. Prilozhenie, 2022, no. 15, 62–66