?
On the impossibility of an invariant attack on Kuznyechik
Journal of Computer Virology and Hacking Techniques. 2022. Vol. 18. P. 61–67.
Fomin D.
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 ways of constructing invariant subsets. A new approach to invariant attacks is presented and it proves that there are no subsets based on S-Box properties that are invariant under round functions of Kuznyechik.
Minets M., Krasnozhenov G., Trofimova E. et al., PeerJ Computer Science 2026 Vol. 12 Article e4063
This article presents CAD2TechSpec, a novel framework for automating design processes within computer-aided design (CAD) systems by leveraging multimodal large language models (LLMs). The framework enables the analysis and generation of detailed design specifications, including the automated creation of machining process plans. Our system architecture combines 3D model rendering, dimensionality reduction techniques, and the capabilities ...
Added: August 12, 2026
Мизинов П. В., Journal of Computer Virology and Hacking Techniques 2023 No. 20 P. 383–396
Biometric vein recognition systems are vulnerable to presentation attacks. Traditionally, researchers have used a near-infrared (NIR) drawing of the user’s vascular bed to create a presentation attack instrument (PAI). This paper investigates the feasibility of using free software to capture a venous pattern of the hand without NIR under normal lighting conditions and to create ...
Added: August 11, 2026
Ali S., Bocharnikov V., Ratnikov F. et al., Sensors 2026 Vol. 26 No. 16 Article 5024
Large distributed sensor arrays require repeated recalibration as radiation damage, material aging, gain variation, and readout drift alter channel responses. We studied a high-granularity calorimeter as a large sensor array and addressed unsupervised recalibration from two unpaired datasets: a nominal reference response and an aged response with attenuated cell-wise signals. Aging was modeled by a ...
Added: August 11, 2026
Trubochkina N. K., М.: Издательство «Юрайт», 2026.
This textbook is designed to develop students' holistic understanding of modern production processes and methods for their analysis and management using machine learning technologies. In the context of the fourth industrial revolution, where traditional engineering disciplines are inextricably intertwined with intelligent data processing methods, there is a growing need for specialists capable of integrating knowledge ...
Added: August 8, 2026
Kulev Y., Maksaev A., Promyslov V., Linear Algebra and its Applications 2026 Vol. 730 P. 51–72
The notion of λ-th upper scrambling index was introduced by Huang and Liu in 2010, as a generalization of a notion considered by Akelbek and Kirkland in 2009. For a primitive digraph D, it is defined as the smallest positive integer k such that for every λ vertices of D there exist directed paths of lengths k from these vertices to a common vertex. This ...
Added: August 7, 2026
Kanunnikov A., Promyslov V., Vassilieva E., Electronic Journal of Combinatorics 2024 Vol. 31 No. 3 Article P3.6
Introduced by Goulden and Jackson in their 1996 paper, the matchings-Jack conjecture and the hypermap-Jack conjecture (also known as the b-conjecture) are two major open questions relating Jack symmetric functions, the representation theory of the symmetric groups and combinatorial maps. They show that the coefficients in the power sum expansion of some Cauchy sum for ...
Added: August 7, 2026
Фирсанова В. И., ACM, 2026.
The inclusion of autistic people can be augmented by a mobile app that provides information without a human mediator making information perception more liberating for people in the spectrum. This paper is an overview of a doctoral work dedicated to the development of a web-based mobile tool for supporting the inclusion of people on the ...
Added: August 4, 2026
Фирсанова В. И., Хлусова Я. К., CEUR Workshop Proceedings, 2025.
Knowledge graphs are widely used in Retrieval Augmented Generation (RAG) and Explainable AI (XAI), since they can illustrate semantic relationships generated by Large Language Models (LLMs). Recent studies focus on generating knowledge graphs from unstructured data to improve RAG performance; however, they do not explain the underlying graph structure. The analysis of synthetic graphs behind ...
Added: August 4, 2026
Spiridonov V. P., Belousov N. M., Sarkissian G. A., Analysis and Mathematical Physics 2026 Vol. 16 Article 96
Hyperbolic hypergeometric integrals are defined as Barnes-type integrals of products of hyperbolic gamma functions. Their reduction to ordinary hypergeometric functions is well known. We study in detail their degeneration to complex hypergeometric functions. Namely, using uniform bounds on the integrands, we prove that the univariate hyperbolic beta integral and the conical function degenerate to two-dimensional ...
Added: August 4, 2026
Gayfullin S., Kikteva V., Results in Mathematics 2026 Vol. 81 No. 5 Article 146
In this paper we obtain a criterion of flexibility for an affine complexity-zero horospherical variety. This result generalizes previously known results on flexibility of normal horospherical varieties, horospherical varieties with an action of a semisimple group, and non-normal toric varieties. ...
Added: August 3, 2026
Lunts V., Функциональный анализ и его приложения 2026 Т. 60 № 3 С. 127–129
Доказано, что канонические полуортогональные разложения производной категории диаграммной схемы индуцируют аналогичные разложения подкатегории совершенных комплексов. ...
Added: August 3, 2026
Belomestny D., Gasnikov A., Gladin E. et al., Russian Mathematical Surveys 2026 Vol. 81 No. 4(490) P. 3–90
Reinforcement learning (RL) is increasingly grounded in tools from probability, optimization, and operator theory. This survey organizes the mathematical structures that underpin the design and analysis of modern algorithms in RL. We begin from Markov decision processes (MDPs) and the Bellman operators, emphasizing contraction mappings, monotonicity, and fixed-point theory that yield convergence guarantees and rates ...
Added: August 3, 2026
Chepovskiy A., М.: Мастерская Печати Идей, 2026.
The textbook presents methods and algoгithms for automatic analysis
of соrроrа of texts in natural languages. It is intended fоr sfudenБ of
methods of processing texts in паtчrаl languages and creating training
arays of texts.
Fоr students, graduate students and researchers studying methods
of computational linguistics and word processing. ...
Added: August 1, 2026
A. Radomskii, Mathematical notes 2026 Vol. 119 No. 6 P. 1136–1147
We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in\mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some restrictions. As applications, for any $t>0$, we obtain an upper bound for the number of $n\in [1,N]$ such that $a_{n}/ \varphi (a_{n})> t$. ...
Added: July 31, 2026
Абызов А. Н., Буутай П. Н., Математика и теоретические компьютерные науки 2026 Т. 4 № 2 С. 4–75
This paper is expository and methodological in nature and is devoted to the development of E.I. Zolotarev’s ideas embedded in his approach to the proof of the quadratic reciprocity law (1872). We consider extensions of Zolotarev’s approach to abstract number rings presented in the work of A. Brunyate and P.L. Clark (2015), and to finite ...
Added: July 30, 2026
Ponomarenko A., / Series Computer Science "arxiv.org". 2025.
This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive Graph Merge (NGM), Intra Graph Traversal Merge (IGTM), and Cross Graph Traversal Merge (CGTM). These algorithms differ in their approach to vertex selection ...
Added: July 30, 2026
Уилкокс П., Romanov A., М.: ДМК Пресс, 2025.
Книга, которую вы держите в руках, продолжает серию «Книжная полка истового
инженера», которая издается при поддержке компании YADRO.
Данная книга представляет собой учебник по теоретическим основам продвинутой
функциональной верификации и содержит лучшие практики, используемые в настоящее
время. В ней подробно описана унифицированная методология верификации
(UVM) и раскрыты такие темы, как функциональный виртуальный прототип, функциональное
покрытие, утверждения, формальная верификация, тестбенчи, косимуляция,
эмуляция, аппаратное ...
Added: July 30, 2026
Kodaneva N., Lando S., Journal of Geometry and Physics 2025 Vol. 210 Article 105421
Weight systems are functions on chord diagrams satisfying so-called Vassiliev’s 4-term relations. They are closely related to finite type knot invariants, see [31 Certain weight systems can be derived from graph invariants, see a recent account in [19]. Another main source of weight systems are Lie algebras, the construction due to D. Bar-Natan [3] and ...
Added: January 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
М. А. Коврижных, Д. Б. Фомин, Прикладная дискретная математика 2022 № 57 С. 5–21
In this paper, we study a generalized construction of (2m, 2m)-functions using monomial and arbitrary m-bit permutations as constituent elements. We investigate the possibility of constructing bijective vectorial Boolean functions (permutations) with specified cryptographic properties that ensure the resistance of encryption algorithms to linear and differential methods of cryptographic analysis. We propose a heuristic algorithm ...
Added: October 8, 2022
Маршалко Г. Б., Денисенко Д. В., Рудской В. И. et al., Journal of Experimental and Theoretical Physics 2019 Vol. 128 No. 4 P. 552–559
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. ...
Added: October 7, 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
Karakaya E., Sarı E., Alatas S., Resources Policy 2021 Vol. 70 Article 101904
This study investigates the main driving forces behind material use of the EU in the case of heterogeneity between member states with paying special attention to the comparison of domestic material consumption (DMC) with material footprint (MF). To this end, we first classify countries into several clubs based on time-varying behavior of two material use indicators and ...
Added: September 23, 2022
D. B. Fomin, M. A. Kovrizhnykh, Математические вопросы криптографии 2022 Vol. 13 No. 2 P. 37–52
The work is dedicated to the theoretical substantiation of a directed search for 8-bit permutations with given cryptographic properties: differential uniformity and nonlinearity. The statements on the partition of the set of vectorial Boolean functions derived using generalized construction into equivalence classes are proved. The statements that allow one to reject functions from equivalence classes ...
Added: August 24, 2022