Marina Aleksandrovna Pudovkina
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Marina Aleksandrovna Pudovkina has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
Boris Aleksandrovich Pogorelov
Academy of Cryptography of the Russian Federation, Moscow
17 shared publicationsB. A. Pogorelov
6 shared publications- Boris A. Pogorelov
Academy of Cryptography of Russian Federation , Moscow , Russia
6 shared publications Марина Александровна Пудовкина
4 shared publicationsAkademiya Kriptografii Rossiyskoy Federatsii (Moskva)
3 shared publicationsB.A. Pogorelov
3 shared publications
Latest Publications
- Open Access
Mathematical problems and solutions of the Ninth International Olympiad in Cryptography NSUCRYPTO
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 mail goal of NSUCRYPTO is to draw attention of students and young researchers to modern cryptography and raise awareness about open problems in the field. We present problems of NSUCRYPTO'22 and their solutions. There are 16 problems on the following topics: ciphers, cryptosystems, protocols, e-money and cryptocurrencies, hash functions, matrices, quantum computing, S-boxes, etc. They vary from easy mathematical tasks that could be solved by school students to open problems that deserve separate discussion and study. So, in this paper, we consider several open problems on three-pass protocols, public and private keys pairs, modifications of discrete logarithm problem, cryptographic permutations and quantum circuits.
Open AccessMathematical problems and solutions of the Ninth International Olympiad in Cryptography NSUCRYPTO
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 mail goal of NSUCRYPTO is to draw attention of students and young researchers to modern cryptography and raise awareness about open problems in the field. We present problems of NSUCRYPTO'22 and their solutions. There are 16 problems on the following topics: ciphers, cryptosystems, protocols, e-money and cryptocurrencies, hash functions, matrices, quantum computing, S-boxes, etc. They vary from easy mathematical tasks that could be solved by school students to open problems that deserve separate discussion and study. So, in this paper, we consider several open problems on three-pass protocols, public and private keys pairs, modifications of discrete logarithm problem, cryptographic permutations and quantum circuits.
- 21 July 2021
- Published by Sobolev Institute of Mathematics in Sibirskie Elektronnye Matematicheskie Izvestiya
- Vol. 18 (2) , А.4-А.29
The Seventh International Olympiad in Cryptography: Problems and solutions
- 21 July 2021
- Published by Sobolev Institute of Mathematics in Sibirskie Elektronnye Matematicheskie Izvestiya
- Vol. 18 (2) , А.4-А.29
The Seventh International Olympiad in Cryptography: Problems and solutions
- 9 February 2020
- Published by Walter de Gruyter GmbH in Discrete Mathematics and Applications
- Vol. 30 (1) , 7-22
Classification of distance-transitive orbital graphs of overgroups of the Jevons group
The Jevons group AS̃n is an isometry group of the Hamming metric on the n-dimensional vector space Vn over GF(2). It is generated by the group of all permutation (n × n)-matrices over GF(2) and the translation group on Vn. Earlier the authors of the present paper classified the submetrics of the Hamming metric on Vn for n ⩾ 4, and all overgroups of AS̃n which are isometry groups of these overmetrics. In turn, each overgroup of AS̃n is known to define orbital graphs whose “natural” metrics are submetrics of the Hamming metric. The authors also described all distance-transitive orbital graphs of overgroups of the Jevons group AS̃n. In the present paper we classify the distance-transitive orbital graphs of overgroups of the Jevons group. In particular, we show that some distance-transitive orbital graphs are isomorphic to the following classes: the complete graph 2n, the complete bipartite graph K2n−1,2n−1, the halved (n + 1)-cube, the folded (n + 1)-cube, the graphs of alternating forms, the Taylor graph, the Hadamard graph, and incidence graphs of square designs.
- 9 February 2020
- Published by Walter de Gruyter GmbH in Discrete Mathematics and Applications
- Vol. 30 (1) , 7-22
Classification of distance-transitive orbital graphs of overgroups of the Jevons group
The Jevons group AS̃n is an isometry group of the Hamming metric on the n-dimensional vector space Vn over GF(2). It is generated by the group of all permutation (n × n)-matrices over GF(2) and the translation group on Vn. Earlier the authors of the present paper classified the submetrics of the Hamming metric on Vn for n ⩾ 4, and all overgroups of AS̃n which are isometry groups of these overmetrics. In turn, each overgroup of AS̃n is known to define orbital graphs whose “natural” metrics are submetrics of the Hamming metric. The authors also described all distance-transitive orbital graphs of overgroups of the Jevons group AS̃n. In the present paper we classify the distance-transitive orbital graphs of overgroups of the Jevons group. In particular, we show that some distance-transitive orbital graphs are isomorphic to the following classes: the complete graph 2n, the complete bipartite graph K2n−1,2n−1, the halved (n + 1)-cube, the folded (n + 1)-cube, the graphs of alternating forms, the Taylor graph, the Hadamard graph, and incidence graphs of square designs.
- 2 January 2020
- Published by Springer Nature
- p. 189-197
On Integral Distinguishers for Ciphers Based on the Feistel Network Generalizations
- 2 January 2020
- Published by Springer Nature
- p. 189-197
On Integral Distinguishers for Ciphers Based on the Feistel Network Generalizations
- 30 December 2019
- Published by Steklov Mathematical Institute
- Vol. 10 (4) , 77-116
Характеризация отображений через свойство неизометричности
Для целочисленной метрики $\mu $ на векторном пространстве над полем $GF(2)$ вводится новая мера несогласованности преобразования $g$ и метрики $\mu$, названная показателем $\mu $-неизометричности преобразования. В работе для целочисленных метрик, инвариантных относительно группы сдвигов, и разных классов преобразований, включая инволютивные APN, найдены показатели $\mu $-неизометричности или их экстремальные оценки.- 30 December 2019
- Published by Steklov Mathematical Institute
- Vol. 10 (4) , 77-116
Характеризация отображений через свойство неизометричности
Для целочисленной метрики $\mu $ на векторном пространстве над полем $GF(2)$ вводится новая мера несогласованности преобразования $g$ и метрики $\mu$, названная показателем $\mu $-неизометричности преобразования. В работе для целочисленных метрик, инвариантных относительно группы сдвигов, и разных классов преобразований, включая инволютивные APN, найдены показатели $\mu $-неизометричности или их экстремальные оценки.- 1 September 2019
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 12,p. 24-27
Variations of orthomorphisms and pseudo-hadamard transformations on nonabelian groups
- 1 September 2019
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 12,p. 24-27
Variations of orthomorphisms and pseudo-hadamard transformations on nonabelian groups
- 1 September 2019
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 12,p. 237-239
On APN-functions and division property of multisets
- 1 September 2019
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 12,p. 237-239
On APN-functions and division property of multisets
- 1 September 2019
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 12,p. 203-205
On properties of the largest probability for difference transition under a random bijec-tive group mapping
- 1 September 2019
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 12,p. 203-205
On properties of the largest probability for difference transition under a random bijec-tive group mapping
- 1 September 2019
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 12,p. 27-29
On a class of power piecewise affine permutations on nonabelian groups of order 2m with cyclic subgroups of index 2
- 1 September 2019
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 12,p. 27-29
On a class of power piecewise affine permutations on nonabelian groups of order 2m with cyclic subgroups of index 2
- 6 May 2019
- Published by Steklov Mathematical Institute
- Vol. 10 (1) , 115-142
$\otimes_{\mathbf{W}}$-markovianity of XSL-block ciphers connected with properties of their round functions
Ранее авторами были описаны условия существования подстановочных гомоморфизмов для некоторого класса $\otimes_{\mathbf{W}}$-марковских алгоритмов. В настоящей работе получены условия $\otimes_{\mathbf{W}}$-марковости $S$-боксов и преобразования линейного слоя. В частности, приведено достаточное условие на $S$-боксы и преобразование линейного слоя, при которых XSL-алгоритм является $\otimes_{\mathbf{W}}$-марковским.
- 6 May 2019
- Published by Steklov Mathematical Institute
- Vol. 10 (1) , 115-142
$\otimes_{\mathbf{W}}$-markovianity of XSL-block ciphers connected with properties of their round functions
Ранее авторами были описаны условия существования подстановочных гомоморфизмов для некоторого класса $\otimes_{\mathbf{W}}$-марковских алгоритмов. В настоящей работе получены условия $\otimes_{\mathbf{W}}$-марковости $S$-боксов и преобразования линейного слоя. В частности, приведено достаточное условие на $S$-боксы и преобразование линейного слоя, при которых XSL-алгоритм является $\otimes_{\mathbf{W}}$-марковским.