?
Estimating the Complexity of Grover’s Algorithm for Key Search of Block Ciphers Defined by GOST R 34.12-2015
Journal of Experimental and Theoretical Physics. 2019. Vol. 128. No. 4. P. 552–559.
Маршалко Г. Б., Денисенко Д. В., Рудской В. И., Никитенкова М. В., Шишкин В. А.
Translator: И. Никитин
Following the approach proposed in [3], we estimate resources of a quantum computer required for solving the key search problem of block cipher algorithms Kuznechik and Magma, defined by the national standard GOST R 34.12-2015, with the use of Grover’s quantum algorithm.
Aleksei Samarin, Nazarenko A., Nazarenko D. et al., Machine Learning and Knowledge Extraction 2026 Vol. 8 No. 10 Article 330
Automated microscopic image analysis is essential for quantitative microbiology, yet manual acquisition and generic recognition models struggle with morphological variability and scene artifacts. We address both ends of this pipeline. First, we present a low-cost, open-source acquisition system, based on an Arduino UNO R3 microcontroller and NEMA 17 stepper motors, that automates focusing, magnification, and ...
Added: October 14, 2026
Mamedov I., Fofanov M., Lukianchenko P. et al., IEEE Access 2026 No. 14 P. 26662–26671
DreamBooth-style personalization, which often relies on one or a few images, can memorize context (background, pose, lighting) rather than learning the subject’s identity, thereby reducing fidelity and limiting prompt-driven edits. P-LoRA (Probability LoRA) is introduced as a training-time modification that biases diffusion timestep sampling and utilizes importance weights, ensuring that the overall objective remains unchanged. ...
Added: October 14, 2026
Springer, 2026.
This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students and practitioners a unique update on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the XIV International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2025). The carefully selected papers cover ...
Added: October 13, 2026
Springer, 2026.
This book offers a comprehensive overview of the latest research, innovations, and practical applications in the field of sustainability, with a focus on construction materials and their use in building and civil engineering structures. As an outcome of the 3rd International Conference on Sustainability: Developments and Innovations (ICSDI 2026), this book presents a selection of ...
Added: October 13, 2026
Dmitriev A., Kornilov V., Batienkov R., Lecture Notes in Civil Engineering 2026 Vol. 886 P. 249–255
Numerous studies have provided compelling evidence that the probability distribution of avalanche sizes follows a power law, and that 1/f noise is present in the stochastic dynamics of landslides. We present a theoretical explanation of these phenomena within the framework of self-organized criticality theory, proposing a discrete-time model in the form of a sandpile cellular ...
Added: October 13, 2026
Dmitriev A., Shulman I., Lebedev A., Studies in Computational Intelligence 2026 Vol. 1265 P. 266–273
A discrete-time model is presented for the self-organization of the X/Twitter social network to the edge of a phase transition, characterized by avalanche-like propagation of information in the network. The model is based on the analogy between the critical dynamics of the X social network and sandpile cellular automata with Manna rule on the Chung-Lu ...
Added: October 13, 2026
Arutyunov K., Kharitonov I. A., Petrosyants K. O., JETP Letters 2026 Vol. 124 No. 6 P. 1–16
Superconducting properties of metallic micro- and nanowires can be entirely different from those of bulk superconductors. Of particular interest is the nonequilibrium current-induced state of a quasi-one-dimensional superconducting channel. The most interesting phenomenon here is the stepped I–V characteristic, explained by a process known as phase slip center activation. If the origin of such step-like ...
Added: October 13, 2026
Makarov D. M., Kalikin N., Fashchevsky K. A. et al., Electrochimica Acta 2026 Vol. 579 Article 150159
Machine learning (ML) has become a powerful tool for accelerating the development of carbon-based supercapacitors;
however, most published models assume that a single predictive framework can describe both conventional
porous carbons and hybrid carbon electrodes. Here, we test this assumption using a comprehensive
benchmark dataset and an extended literature-curated dataset enriched with synthesis- and electrolyte-related
descriptors. Three ML algorithms ...
Added: October 13, 2026
Seidov S., Pugach N., Sidorenko A., Beilstein Journal of Nanotechnology 2025 Vol. 16 P. 1668–1676
In this work we consider a spin model composed of a single spin and connected to an infinitely coordinated Ising chain. Theoretical models of this type arise from various fields of theoretical physics, such as theory of open systems, quantum control, and quantum computations. In the thermodynamic limit of an infinite chain, we map the ...
Added: January 12, 2026
Sergey Kuznetsov, Elena R. Loubenets, / Series arxiv.org "quant-ph". 2025. No. 2509.18059.
This paper is devoted to the problem of optimal generation of N-qubit gates for closed quantum systems -- a key task for the practical implementation of various quantum applications. Based on the generalized Bloch vectors formalism for a finite-dimensional quantum system, we develop a new optimal gates generation model, which is universal in the sense ...
Added: September 23, 2025
Chukhno A., Курочкин А. В., Фомичев В. М., Прикладная дискретная математика. Приложение 2022 Т. 15 С. 73–77
In this paper, new results of the analysis of the KB 256-3 block cipher algorithm are outlined. We set up a difference relation with probability 1 for the six-round algorithm under study and propose a key recovery method using this difference relation for the nine-round KB 256-3 algorithm. We construct an impossible differential for the ...
Added: May 6, 2024
Ilya S., Grigoriy M., Moskalenko I. et al., Physical Review Applied 2024 Vol. 21 No. 4 P. 0
The Toffoli gate takes a special place in the quantum information theory. It opens up a path for efficient
implementation of complex quantum algorithms. Despite tremendous progress of the quantum processors
based on the superconducting qubits, realization of a high-fidelity three-qubit operation is still a challenging
problem. Here, we propose a way to perform a high-fidelity CCZ gate ...
Added: April 24, 2024
Chryssomalakos C., Hanotel L., Guzman Gonzalez E. et al., Modern Physics Letters A 2022 Vol. 37 No. 27 Article 2250184
Holonomic quantum computation makes use of non-abelian geometric phases, associated to the evolution of a subspace of quantum states, to encode logical gates. We identify a special class of subspaces, for which a sequence of rotations results in a non-abelian holonomy of a topological nature, so that it is invariant under any SU(3)-perturbation. Making use ...
Added: December 15, 2022
G. B. Marshalko, Rudskoy V. I., Математические вопросы криптографии 2020 Vol. 11 No. 2 P. 99–110
We study the possibility of applying related key attacks to cryptographic devices with hybrid key systems, when a session key is generated from a long-term «classical» key and a key generated via quantum key distribution (QKD). For the simplest system that XORes quantum key and long-term key we study the impact of compromising the «quantum» ...
Added: October 7, 2022
Dubovitskii K., Makhlin Y., Scientific Reports 2022 Vol. 12 No. 1 Article 10129
In randomized benchmarking of quantum logical gates, partial twirling can be used for simpler implementation, better scaling, and higher accuracy and reliability. For instance, for two-qubit gates, single-qubit twirling is easier to realize than full averaging. We analyze such simplified, partial twirling and demonstrate that, unlike for the standard randomized benchmarking, the measured decay of ...
Added: June 17, 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
Perov A., Инновации в жизнь 2016 № 2(17) С. 89–97
The statistical analysis of iterative block ciphers is carried out for detection of dependences of statistical properties of output sequence depending on number of rounds. It is reasonable to utilize source codes available in the Internet, but their integration into own programs is impeded by at least the following reasons. Firstly, different implementations have different ...
Added: November 1, 2021
Perov A., Вестник НГУЭУ 2016 № 3 С. 290–298
A survey of some important scientic directions in the sphere of symmetric cryptography is presented. We emphasize problems connected with weak keys, with statistical analysis of symmetric algorithms and with investigation of iterative constructions. Some problems, specic to stream ciphers, iterative block ciphers and cryptographic hash-functions, are considered. We also advocate practical significance of scientic ...
Added: November 1, 2021
Perov A., Пестунов А. И., Прикладная дискретная математика 2020 № 3 С. 46–56
The paper explores possibility of applying convolutional neural networks to the security analysis of iterative block ciphers. A new approach for constructing distinguishing
attacks based on a convolutional neural network is proposed. The approach is based
on distinguishing between graphic equivalents of ciphertexts received by the CTR
(counter) encryption mode after different number of rounds, including the number
of ...
Added: November 1, 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
Fomin D., Математические вопросы криптографии 2015 Vol. 6 No. 2 P. 99–108
In this article we consider NVIDIA GPU implementation aspects of an XSL block cipher over the finite field with MDS-matrix linear transformation. We compare obtained results with some other block ciphers. ...
Added: May 4, 2019
Дали Ф. А., Маршалко Г. Б., Mironkin V., Проблемы информационной безопасности. Компьютерные системы 2017 № 3 С. 87–90
In this paper we study rotational probabilities for 2-GOST block cipher, which is a modification of GOST 28147-89. We show that despite the fact that this algorithm does not belong to the family of ARX-transformations in some cases it is possible to evaluate its rotational properties and evaluate the applicability of rotational analysis. ...
Added: January 27, 2018
A. Yu. Nesterenko, Математические вопросы криптографии 2017 Vol. 8 No. 2 P. 117–130
In this article we present a new authenticated encryption mode for arbitrary block cipher. This mode is a combination of well known XEX (XorEncryption-Xor) mechanism used in XTS encryption mode and universal hash function with predetermined properties from special class of functions. The bit length of authentication code being twice as much as the length ...
Added: January 20, 2018
Avdoshin S. M., Набебин А. А., М.: ДМК Пресс, 2017.
The textbook contains necessary information about universal and classical algebras, systems of axioms for the basic algebraic structures (groupoid, monoid, semi-groups, groups, partial orders, rings, fields). The basic cryptographic algorithms are described. Error-correcting codes - linear, cyclic, BCH are considered. Algorithms for designing of such codes are given. Many examples are shown. It is put ...
Added: August 19, 2016