?
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.
Shilov A. L., Elesin L., Kravtsov M. et al., Nature Communications 2026 Vol. 17 No. 1 Article 9734
Identifying the microscopic processes limiting conductivity is essential for understanding correlated quantum materials. In twisted bilayer graphene, metallic resistivity follows ρ ~ Tα with widely varying α, fueling competing interpretations from phonon-limited transport and umklapp scattering to strange metallicity and heavy-fermion renormalization. Here, we use terahertz excitation to selectively heat electrons while keeping the lattice cold, separating ...
Added: September 20, 2026
Springer, 2026.
Two volumes of the SPECOM 2026 proceedings contain a collection of submitted papers presented at SPECOM 2026, which were thoroughly reviewed by members of the Program Committee and additional reviewers consisting of almost 80 experts in the conference topic areas. In total, 65 regular full papers out of 99 submissions made via the EasyChair electronic ...
Added: September 20, 2026
Aleksei Samarin, Alexander Savelev, Aleksei Toropov et al., Pattern Recognition and Image Analysis 2026 Vol. 36 No. 2 P. 323–334
In this paper, an improved approach for automatic wildlife detection in natural environments based on the integration of a neural network architecture with a two-stream attention mechanism and a novel preclassification step based on infrared data has been presented. The proposed method addresses one of the key challenges in environmental monitoring: the need for scalable ...
Added: September 19, 2026
Aleksei Samarin, Nazarenko A., Kotenko E. et al., Proceedings of the ACM on Management of Data, USA 2026 Vol. 4 No. 1 P. 1–28
Modern knowledge and large volumes of data are increasingly encoded within neural networks, making the task of simplifying their structures and reducing the number of parameters especially relevant, both to improve efficiency and to facilitate deployment in resource-constrained environments. This paper presents a novel approach to neural network compression that addresses redundancy at both the ...
Added: September 19, 2026
Aleksei Samarin, Alexander Savelev, Aleksei Toropov et al., Pattern Recognition and Image Analysis 2025 Vol. 35 No. 2 P. 148–158
This paper describes our research on creating classifiers for microbial images (micrococci microscopy images) obtained from pictures of unfixed microscopic scenes. In our work, we propose an AutoML approach based on the automatic generation and analysis of the feature space for constructing the most optimal descriptors of microorganism images for subsequent classification. This makes it ...
Added: September 19, 2026
Aleksei Samarin, Alexander Savelev, Aleksei Toropov et al., Pattern Recognition and Image Analysis 2026 Vol. 36 No. 2 P. 302–312
The lack of annotated microscopic datasets remains a major obstacle to training robust deep learning models for microbial classification. In this paper, a novel data augmentation pipeline that uses visual–linguistic large-scale models to generate synthetic microscopic images of six different bacterial and nonbacterial classes has been proposed. Synthetic samples have gradually been added to the ...
Added: September 19, 2026
Springer, Cham, 2026.
computer vision ...
Added: September 19, 2026
Springer, Cham, 2026.
Added: September 19, 2026
FRUCT Oy, 2024.
Added: September 19, 2026
FRUCT Oy, 2024.
Added: September 19, 2026
FRUCT Oy, 2025.
Added: September 19, 2026
FRUCT Oy, 2026.
Added: September 19, 2026
Aleksei Samarin, Nazarenko A., Kotenko E. et al., Machine Learning and Knowledge Extraction 2026 Vol. 8 No. 8 P. 1–26
This paper presents a novel method for pruning deep neural networks based on the concept of flow, derived from the continuous modeling of signal propagation across layers. We derive flow functions for fully connected, convolutional, and self-attention architectures, and we propose a new iterative pruning algorithm, Iterative Flow-Aware Pruning (IFAP), that leverages these measures to ...
Added: September 19, 2026
Myachin A. L., Procedia Computer Science 2026 Vol. 287 P. 193–200
We extend the static pattern analysis method to the temporal dimension by introducing a six-type trajectory taxonomy that classifies objects according to the frequency and structure of pattern switches over an observation window of T > 8 periods. For each object, a reference pattern is designated as the most frequently occupied group over the observation ...
Added: September 18, 2026
Копьев А., JETP Letters 2026 Vol. 123 No. 5 P. 310–316
The incompressible three-dimensional Euler equations develop very thin pancake-like regions of exponen tially increasing vorticity. The characteristic thickness of such regions decreases exponentially with time, while the other two dimensions do not change considerably, making the flow near each pancake strongly anisotropic. The pancakes emerge in increasing number with time, which may enhance the anisotropy ...
Added: September 18, 2026
Громов Р. С., Нестеров Р.А., Proceedings of the Institute for System Programming of the RAS 2026 Vol. 38 No. 4 P. 23–44
This paper explores the performance criteria of the newest algorithm for solving the problem of finding shortest paths on a graph from a given vertex – Bounded Multi-Source Shortest Path Algorithm
(BM-SSP). The algorithm was published in 2025 and, as its creators claim, it is asymptotically superior to Dijkstra’s deterministic algorithm. However, in the publication devoted ...
Added: September 18, 2026
Захаров А. В., Düven H., Capar M. I., Physics Letters A 2026 No. 576 Article 131388
Molecular dynamics simulations were carried out to study the structural properties of nematic pentyl
cyanobiphenyl (5CB) and pentyloxy cyanobiphenyl (5OCB) liquid crystals (LCs) doped with gold nanoparti
cles (GNPs) of different numbers, shapes and sizes. The spherical GNPs of two different radii and rod-like have
been doped in 5CB and 5OCB cyanobiphenyl liquid crystals. In order to describe ...
Added: September 17, 2026
Кузнецов М. Е., Полякова М., Лукьянович В. et al., ФАНУ "Востокгосплан", 2026.
Обзор международных практик развития робототехники и искусственного интеллекта и оценка возможностей их применения в условиях России, в первую очередь для Дальнего Востока и Арктической зоны РФ ...
Added: September 16, 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