Natalia Tokareva
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
Natalia Tokareva has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Vladimirovich Kutsenko
Novosibirsk State University, Novosibirsk, Russia
5 shared publications - Anastasiya A. Gorodilova
Novosibirsk State University Novosibirsk Russia
5 shared publications - Sergey Agievich
Belarusian State Univ, Minsk, BELARUS
5 shared publications - Alexey Oblaukhov
Novosibirsk State University
3 shared publications - Bart Preneel
KU Leuven
3 shared publications - Claude Carlet
University of Paris 8 Saint-Denis France
3 shared publications
Latest Publications
- 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
- Open Access
- 26 May 2021
- Published by Sobolev Institute of Mathematics in Sibirskie Elektronnye Matematicheskie Izvestiya
- Vol. 18 (1) , 561-578
Connections between quaternary and Boolean bent functions
- 26 May 2021
- Published by Sobolev Institute of Mathematics in Sibirskie Elektronnye Matematicheskie Izvestiya
- Vol. 18 (1) , 561-578
Open AccessConnections between quaternary and Boolean bent functions
- 1 September 2020
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 13,p. 78-80
On the number of unsuitable Boolean functions in constructions of filter and combining models of stream ciphers
- 1 September 2020
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 13,p. 78-80
On the number of unsuitable Boolean functions in constructions of filter and combining models of stream ciphers
- 1 September 2020
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 13,p. 41-43
Cryptographic properties of a simple S-box construction based on a Boolean function and a permutation
- 1 September 2020
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 13,p. 41-43
Cryptographic properties of a simple S-box construction based on a Boolean function and a permutation
- 1 September 2020
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 13,p. 40-41
On one-to-one property of a vectorial Boolean function of the special type
- 1 September 2020
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 13,p. 40-41
On one-to-one property of a vectorial Boolean function of the special type
- 1 September 2020
- Published by Tomsk State University in PRIKLADNAYa DISKRETNAYa MATEMATIKA
- No. 49,p. 18-34
METRICAL PROPERTIES OF THE SET OF BENT FUNCTIONS IN VIEW OF DUALITY
In the paper, we give a review of metrical properties of the entire set of bent functions and its significant subclasses of self-dual and anti-self-dual bent functions. We present results for iterative construction of bent functions in n + 2 variables based on the concatenation of four bent functions and consider related open problem proposed by one of the authors. Criterion of self-duality of such functions is discussed. It is explored that the pair of sets of bent functions and affine functions as well as a pair of sets of self-dual and anti-self-dual bent functions in n >= 4 variables is a pair of mutually maximally distant sets that implies metrical duality. Groups of automorphisms of the sets of bent functions and (anti-)self-dual bent functions are discussed. The solution to the problem of preserving bentness and the Hamming distance between bent function and its dual within automorphisms of the set of all Boolean functions in n variables is considered.
- 1 September 2020
- Published by Tomsk State University in PRIKLADNAYa DISKRETNAYa MATEMATIKA
- No. 49,p. 18-34
METRICAL PROPERTIES OF THE SET OF BENT FUNCTIONS IN VIEW OF DUALITY
In the paper, we give a review of metrical properties of the entire set of bent functions and its significant subclasses of self-dual and anti-self-dual bent functions. We present results for iterative construction of bent functions in n + 2 variables based on the concatenation of four bent functions and consider related open problem proposed by one of the authors. Criterion of self-duality of such functions is discussed. It is explored that the pair of sets of bent functions and affine functions as well as a pair of sets of self-dual and anti-self-dual bent functions in n >= 4 variables is a pair of mutually maximally distant sets that implies metrical duality. Groups of automorphisms of the sets of bent functions and (anti-)self-dual bent functions are discussed. The solution to the problem of preserving bentness and the Hamming distance between bent function and its dual within automorphisms of the set of all Boolean functions in n variables is considered.
- 21 October 2019
- Published by Taylor & Francis in Cryptologia
- Vol. 44 (3) , 223-256
The Fifth International Students’ Olympiad in cryptography—NSUCRYPTO: Problems and their solutions
Problems and their solutions of the Fifth International Students’ Olympiad in cryptography NSUCRYPTO’2018 are presented. We consider problems related to attacks on ciphers and hash functions, Boolean functions, quantum circuits, Enigma, etc. We discuss several open problems on orthogonal arrays, Sylvester matrices, and disjunct matrices. The problem of existing an invertible Sylvester matrix whose inverse is again a Sylvester matrix was completely solved during the Olympiad.
- 21 October 2019
- Published by Taylor & Francis in Cryptologia
- Vol. 44 (3) , 223-256
The Fifth International Students’ Olympiad in cryptography—NSUCRYPTO: Problems and their solutions
Problems and their solutions of the Fifth International Students’ Olympiad in cryptography NSUCRYPTO’2018 are presented. We consider problems related to attacks on ciphers and hash functions, Boolean functions, quantum circuits, Enigma, etc. We discuss several open problems on orthogonal arrays, Sylvester matrices, and disjunct matrices. The problem of existing an invertible Sylvester matrix whose inverse is again a Sylvester matrix was completely solved during the Olympiad.
- Open Access
- 8 February 2019
- Published by Taylor & Francis in Cryptologia
- Vol. 43 (2) , 138-174
Problems and solutions from the fourth International Students’ Olympiad in Cryptography (NSUCRYPTO)
Mathematical problems and their solutions from the fourth International Students’ Olympiad in cryptography (NSUCRYPTO-2017) are presented. We consider problems related to attacks on ciphers and hash functions, cryptographic Boolean functions, linear branch numbers, addition chains, and error correction codes, among others. We discuss several open problems involving the algebraic structures of cryptographic functions, useful proof-of-work algorithms, the Boolean hidden shift problem, and quantum computing.
- 8 February 2019
- Published by Taylor & Francis in Cryptologia
- Vol. 43 (2) , 138-174
Open AccessProblems and solutions from the fourth International Students’ Olympiad in Cryptography (NSUCRYPTO)
Mathematical problems and their solutions from the fourth International Students’ Olympiad in cryptography (NSUCRYPTO-2017) are presented. We consider problems related to attacks on ciphers and hash functions, cryptographic Boolean functions, linear branch numbers, addition chains, and error correction codes, among others. We discuss several open problems involving the algebraic structures of cryptographic functions, useful proof-of-work algorithms, the Boolean hidden shift problem, and quantum computing.
- 1 September 2018
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 11,p. 105-106
On codes used in biometrical cryptosystems
- 1 September 2018
- Published by Tomsk State University in Prikladnaya diskretnaya matematika. Prilozhenie
- No. 11,p. 105-106
On codes used in biometrical cryptosystems