?
Improved Objective Functions to Search for 8 × 8 Bijective S-Boxes With Theoretical Resistance Against Power Attacks Under Hamming Leakage Models
IEEE Access. 2022. Vol. 10. P. 11886–11891.
Martínez-Díaz I., Legón-Pérez C. M., Rojas O. et al., Journal of Information Security and Applications 2022 Vol. 69 Article 103272
Added: September 18, 2026
Legón-Pérez C. M., Sánchez-Muiña R., Miyares-Moreno D. et al., Applied Sciences (Switzerland) 2021 Vol. 11 No. 11 Article 4815
Added: September 18, 2026
Legón-Pérez C. M., Menéndez-Verdecía J. A., Martínez-Díaz I. et al., Information (Switzerland) 2021 Vol. 12 No. 12 Article 509
Added: September 18, 2026
Freyre-Echevarría A., Martínez-Díaz I., Legón-Pérez C. M. et al., IEEE Access 2020 Vol. 8 P. 202728–202737
Added: September 18, 2026
Martínez-Díaz I., Legón-Pérez C. M., Sosa Gómez G., Cryptography 2025 Vol. 9 No. 2 Article 45
Added: September 18, 2026
Lazarev A. A., Lemtyuzhnikova D. V., Tyunyatkin A. A. et al., IFAC-PapersOnLine 2022 Vol. 55 No. 10 P. 2881–2886
This research extends the interpolation approach to approximating the objective function value for the minimization maximum lateness problem. The interpolation approach is defined using a special objective function Lmax(α), which is proven to be continuous and depends only on α transform coefficient. Such a function is proven to be monotonically increasing, and this property is ...
Added: December 5, 2022
Fomin D., Journal of Computer Virology and Hacking Techniques 2022 Vol. 18 P. 61–67
Currently numerous cryptographic systems are based on SP-networks. These primitives are supposed to be secure but recent investigations show that some attacks are possible. The aim of this work is to study how secure the Russian standardized block cipher Kuznyechik over invariant attacks. We study the already known decompositions of its permutation and show the ...
Added: November 29, 2021
Fomin D., Прикладная дискретная математика. Приложение 2021 № 14 С. 51–55
The paper studies new ways of con- structing differentially 2δ-uniform bijections over F_{2^{2m}} , m≥3, that are based on TU-construction. Some well known results on the constructing differentially 4-uniform permutations over F_{2^{2m}} are generalized in this work. The core idea is to use TU-construction and differentially δ-uniform bijections to construct 2^t · δ-uniform permutations. A generalized method for constructing 2m-bit differentially 4-uniform permutations ...
Added: September 22, 2021
Авраамова О. Д., Fomin D., Серов В. А. et al., Математические вопросы криптографии 2021 Vol. 12 No. 2 P. 21–38
In this paper we consider a bit-sliced implementation of the non-linear transformation shared by GOST R 34.12-2015 “Kuznyechik” block cipher and GOST R 34.11-2012 “Streebog” hash function. We combine analytical and computer methods to get a 226 Boolean operations representation. ...
Added: July 26, 2021
Chistyakov V., Pardalos P. M., Journal of Optimization Theory and Applications 2015 Vol. 167 No. 2 P. 585–616
This paper addresses the tolerance approach to the sensitivity analysis of optimal solutions to a nonlinear optimization problem of the form: minimize the total cost of a trajectory over all admissible discrete trajectories, where the total cost is expressed through individual costs by means of a generalized addition operation on the set of all non-negative ...
Added: February 17, 2015