?
О возможности восстановления отрезков сообщения по информации о значениях исходных символов
Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика). 2023. Т. 514. № 2. С. 138–149.
Irkutsk: ISDCT SB RAS, 2026.
We study a model problem on the filtration of a conducting fluid through a
porous layer. A porous medium is presented as an assemblage of identical spherical
cells. Each cell consists of a porous core and liquid shell. We derive apriori estimates
for flow characteristics which show the specific behavior of the fluid. Our estimates
are validated numerically. ...
Added: July 5, 2026
М.: Наука и технологии, 2026.
«Телекоммуникации» ежемесячный рецензируемый производственный, информационно-аналитический и учебно-методический журнал выходит в свет с июля 2000 г.
Для руководителей и работников промышленности, научно-исследовательских и проектно-конструкторских институтов, высших учебных заведений, аспирантов и студентов, а также для специалистов, разрабатывающих, выпускающих и эксплуатирующих средства телекоммуникаций.
Новости разработок и производства, прогнозы развития, защита информации, Нормативные, справочные, аналитические и учебно-методические материалы.
Переход к глобальному информационному ...
Added: July 4, 2026
МФТИ, 2025.
абота редакции научного журнала «Труды Московского физико-технического института» (кратко «Труды МФТИ»), редакционной коллегии и редакционного совета осуществляется в соответствии с Положением, утвержденным ректором института. В состав редакционной коллегии входят руководители института, факультетов, институтских и факультетских кафедр. Главный редактор журнала —президент МФТИ, член-корр. РАН Кудрявцев Н.Н.
Журнал «Труды МФТИ» входит в базу данных РИНЦ (Российский Индекс Научного Цитирования) и доступен в электронной ...
Added: July 4, 2026
Hualin M., Jie Z., Jerome Y. et al., Journal of Internet Technology 2026 Vol. 27 No. 3 P. 367–382
In open, interference-prone scenarios, the scarcity of precisely annotated signal samples limits the application of deep learning–based modulation identification, which generally relies on extensive labeled data for stability. Relation Networks, as an emerging class of deep learning models, exhibit rapid convergence in few-shot learning tasks. Motivated by the fast convergence property of relation-based learning and ...
Added: July 3, 2026
Osipov D., Информационно-управляющие системы 2026 № 3 С. 49–62
Introduction: In many communication systems under construction and those to be created power control and channel estimation techniques developed for the previous generation communication systems fail to provide desired precision. One way to solve this problem is to use order-statistics-based reception techniques that do not need channel estimation or power control. To ensure the desired ...
Added: July 3, 2026
Springer, 2026.
This book presents established and new research on the close connections between graph games and systems of logic, particularly existing and newly designed modal logics. The volume utilizes two graph games – the sabotage game and the hide-and-seek game – to demonstrate the natural interplay between designing new graph games and exploring new kinds of ...
Added: June 30, 2026
Pochinka O., Barinova M., Journal of Geometry and Physics 2026 Vol. 228 P. 1–8
In the present paper we consider an Ω-stable 3-diffeomorphism with a solid or thickened surfaced non-trivial basic set. Such basic sets include, for instance, all one-dimensional expanding attractors and those two-dimensional basic sets that are not expanding. We prove that the chain recurrent set of every such a diffeomorphism necessarily contains at least two non-trivial ...
Added: June 30, 2026
German O., Illarionov A., Известия РАН. Серия математическая 2026 Т. 90 № 3 С. 3–18
Пусть симплекс с целочисленными вершинами - содержащий ровно одну целочисленную точку, отличную от своих вершин. В работе доказывается, что если точка находится во внутренности симплекса или в относительной внутренности некоторой гиперграни симплекса, то объем симплекса ограничен величиной, зависящей только от размерности, в противном случае объем симплекса может быть сколь угодно большим. Этот результат применяется для вывода асимптотической формулы для среднего числа вершин полиэдров ...
Added: June 29, 2026
Netherlands: ScienceDirect, 2025.
No ...
Added: June 28, 2026
Choi Y. R., Мальковский С. И., Stegailov V., В кн.: "Информационные технологии и высокопроизводительные вычисления": Материалы VIII Международной научно-практической конференции, Хабаровск, 15-17 сентября 2025 г.: Хабаровск: Хабаровский Федеральный исследовательский центр, 2025. Гл. 81 С. 317–320.
Работа посвящена разработке и экспериментальному исследованию параллельных алгоритмов матричного умножения и матричной экспоненты с асинхронным обменом данными, использующих принцип наложения вычислений и коммуникаций для максимизации производительности, для систем с несколькими графическими ускорителями и неоднородной топологией. Также представлены теоретические модели оптимизации размера блоков для повышения эффективности расчетов. Алгоритм матричной экспоненты реализован с поддержкой комплексных матриц через ...
Added: October 15, 2025
Якушенокс К. П., Ivanov F., / Series Computer Science "arxiv.org". 2023. No. 2312.15912.
Tavernier and Kabatiansky proposed new variants of the McEliece cryptosystem. In this letter, it is shown that cryptosystem based on correction of errors erasures is equal to the McEliece cryptosystem with worse parametrs public key. It will also add an organic extension of the authors’ idea, although one that has its flaws... ...
Added: September 4, 2024
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
Idrisova V. A., Tokareva N. N., Gorodilova A. A. et al., Prikladnaya Diskretnaya Matematika 2023 No. 62 P. 29–54
Every year the International Olympiad in Cryptography Non-Stop University CRYPTO (NSUCRYPTO) offers mathematical problems for university and school students and, moreover, for professionals in the area of cryptography and computer science. The main goal of NSUCRYPTO is to draw attention of students and young researchers to modern cryptography and raise awareness about open problems in ...
Added: March 19, 2024
Gorodilova A. A., Tokareva N. N., Agievich S. V. et al., Siberian Electronic Mathematical Reports 2022 Vol. 19 No. 1 P. A.9–A.37
Non-Stop University CRYPTO is the International Olympiad in Cryptography that was held for the eight time in 2021. Hundreds of university and school students, professionals from 33 countries worked on mathematical problems in cryptography during a week. The aim of the Olympiad is to attract attention to curious and even open scientific problems of modern ...
Added: March 19, 2024
Malashina A., Doklady Mathematics 2024 Vol. 108 No. 2 P. S282–S292
To provide secure information exchange in communication channels, the correctness of the operation of the relevant information protection systems must be preliminary studied. The mathematical algorithms used in such systems are correct and can theoretically provide the correct statistical properties of the output stream compared to the input. However, at the stage of implementation (programming) ...
Added: November 11, 2023
Vereshchagin N., Theoretical Computer Science 2023 Vol. 940 P. 108–122
We consider the network consisting of three nodes 1, 2, 3 connected by two open channels
1 → 2 and 1 → 3. The information present in the node 1 consists of four strings x , y , z , w.
The nodes 2, 3 know x , w and need to know y , z, respectively. ...
Added: December 19, 2022
Dmitrik N., М.: Инфотропик Медиа, 2022.
This is a textbook on legal informatics, that is, the theoretical part of the course "Information technologies for lawyers", which the author reads at the Faculty of Law of Lomonosov Moscow State University. Legal informatics consists of three parts: information theory, the theoretical foundations of information technology and the foundations of safe behavior in cyberspace. ...
Added: April 1, 2022
Grishchenko A., Понарядов В. В., Урало-алтайские исследования 2021 № 4 (43) С. 7–34
The paper for the first time publishes monuments of the Old Permian language written with Abur, or the script of St. Stephen of Perm; these sources are previously unknown or have not been introduced into academic circulation. They are published here as facsimiles, with transliteration, transcription, and Russian translation. Perhaps the oldest of these inscriptions ...
Added: January 18, 2022
Perov A., Научный вестник Новосибирского государственного технического университета 2019 Т. 76 № 3 С. 87–96
Modern iterative block ciphers are one of the most popular methods for providing a secure information exchange in internet networks. A widespread use of this technology and the development of computing power give rise to a whole list of threats to cryptanalysis of ciphers. Ensuring cryptographic security is in this case one of the key ...
Added: November 22, 2021
Perov A., Conference: 2019 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON) 2019 P. 851–854
This article presents the application of machine learning technologies to cryptography tasks, in particular, the statistical analysis of block ciphers. The author uses the Inception V3 neural network model, which is traditionally used for images recognition. A technology for adapting ciphertexts to the developed technique is proposed. The results of experiments on encrypted sequences are ...
Added: November 20, 2021
Babash A. V., , in: Proceedings of the 10th International Scientific and Practical Conference named after A. I. Kitov "Information Technologies and Mathematical Methods in Economics and Management (IT&MM-2020)"/, Moscow, Russia, October 15-16, 2020Vol. 2830.: CEUR Workshop Proceedings, 2021. P. 337–359.
A trapdoor cipher is a cipher whose algorithm contains some hidden structure (a trapdoor) providing the existence of a subliminal information channel. In cryptographic practice, there could be situations when a constructed cipher may contain some critical defect (a trapdoor) whose identification can significantly weaken the cryptographic strength of this cipher. In this paper, we ...
Added: November 2, 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