Valeriya Idrisova

Valeriya Idrisova
Russian Academy of Sciences | RAS · Sobolev Institute of Mathematics

PhD

About

24
Publications
12,303
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
146
Citations
Citations since 2017
18 Research Items
124 Citations
20172018201920202021202220230510152025
20172018201920202021202220230510152025
20172018201920202021202220230510152025
20172018201920202021202220230510152025

Publications

Publications (24)
Article
Full-text available
Almost perfect nonlinear functions possess optimal resistance to differential cryptanalysis and are widely studied. Most known APN functions are defined using their representation as a polynomial over a finite field and very little is known about combinatorial constructions of them on F2n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackag...
Preprint
Full-text available
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...
Preprint
Full-text available
The International Olympiad in Cryptography NSUCRYPTO is the unique Olympiad containing scientific mathematical problems for professionals, school and university students from any country. Its aim is to involve young researchers in solving curious and tough scientific problems of modern cryptography. In 2020, it was held for the seventh time. Prizes...
Preprint
Full-text available
NSUCRYPTO is the unique cryptographic Olympiad containing scientific mathematical problems for professionals, school and university students from any country. Its aim is to involve young researchers in solving curious and tough scientific problems of modern cryptography. From the very beginning, the concept of the Olympiad was not to focus on solvi...
Article
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 proble...
Preprint
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...
Article
Full-text available
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 p...
Article
Full-text available
Almost perfect nonlinear (APN) functions are of great interest to many researchers since they have the optimal resistance to the differential attack. The existence of bijective APN functions in even number of variables is an important open problem, and there is only one known example of such a function at present. In this paper we consider a specia...
Article
Our subject for investigation is the problem of APN permutation existence for even number of variables. In this work, we consider 2-to-1 functions that are isomorphic to (n − 1)-subfunctions of APN permutations. These 2-to-1 functions can be obtained with a special algorithm which searches for 2-to-1 APN functions that are potentially EA-equivalent...
Preprint
Full-text available
Mathematical problems and their solutions of 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, the linear branch number, addition chains, error correction codes, etc. We discuss several open problems on alg...
Article
Full-text available
The mathematical problems and their solutions of the Third International Students' Olympiad in Cryptography NSUCRYPTO'2016 are presented. We consider mathematical problems related to the construction of algebraic immune vectorial Boolean functions and big Fermat numbers, problems about secrete sharing schemes and pseudorandom binary sequences, biom...
Article
Full-text available
A detailed overview of the mathematical problems and their solutions for the Second International Students’ Olympiad in Cryptography (NSUCRYPTO’2015) is given. The authors consider mathematical problems related to the construction of special discrete structures associated with cryptographic applications, highly nonlinear functions, points on an ell...
Article
We study the symmetric properties of APN functions as well as the structure and properties of the range of an arbitrary APN function. We prove that there is no permutation of variables that preserves the values of an APN function. Upper bounds for the number of symmetric coordinate Boolean functions in an APN function and its coordinate functions i...
Article
Full-text available
A detailed overview of the problems, solutions and experience of the first international student's Olympiad in cryptography, NSUCRYPTO'2014, is given. We start with the rules of participation and the description of rounds. All 15 mathematical problems of the Olympiad and their solutions are considered in detail. The problems are about differential...
Article
Full-text available
Threshold implementation (TI) is a masking method that provides security against first-order DPA with minimal assumptions on the hardware. It is based on multi-party computation and secret sharing. In this paper, we provide an efficient technique to find TIs for all 3 and 4-bit permutations which also covers the set of 3×3 and 4×4 invertible S-boxe...
Conference Paper
We consider recently offered method of S-boxes partition against side-channel attacks. Such partitions were found for all the affine equivalence classes, except one. In this paper we prove that S-boxes of this class do not have admissible partition.

Network

Cited By