On the Sixth International Olympiad in Cryptography NSUCRYPTO

@article{Gorodilova2020OnTS,
  title={On the Sixth International Olympiad in Cryptography NSUCRYPTO},
  author={Anastasiya Gorodilova and Natalia N. Tokareva and Sergey Agievich and Claude Carlet and Evgeny V. Gorkunov and Valeria Idrisova and Nikolay Kolomeec and Alexandr Kutsenko and Roman Lebedev and Svetla Nikova and Alexey Oblaukhov and Irina Pankratova and Marina Pudovkina and Vincent Rijmen and Aleksei Udovenko},
  journal={ArXiv},
  year={2020},
  volume={abs/2005.09563}
}
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 solving olympic tasks but on including unsolved research problems at the intersection of mathematics and cryptography. The Olympiad history starts in 2014… 
The Seventh International Olympiad in Cryptography NSUCRYPTO: problems and solutions
TLDR
This paper considers problems related to attacks on ciphers and hash functions, protocols, permutations, primality tests, etc, and discusses several open problems on JPEG encoding, Miller — Rabin primality test, special bases in the vector space, AES-GCM.
An overview of the Eight International Olympiad in Cryptography "Non-Stop University CRYPTO"
TLDR
This paper considers several open problems on quantum error correction, finding special permutations and s-Boolean sharing of a function, and obtaining new bounds on the distance to affine vectorial functions of the Olympiad’2021.
The Seventh International Olympiad in Cryptography: Problems and solutions
TLDR
This paper considers problems related to attacks on ciphers and hash functions, protocols, permutations, primality tests, etc, and discusses several open problems on JPEG encoding, Miller — Rabin primality test, special bases in the vector space, AES-GCM.

References

SHOWING 1-10 OF 18 REFERENCES
Problems, solutions and experience of the first international student's Olympiad in cryptography
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 rules of participation and
Mathematical problems of the Second International Students’ Olympiad in Cryptography
TLDR
The authors consider mathematical problems related to the construction of special discrete structures associated with cryptographic applications, highly nonlinear functions, points on an elliptic curve, crypto machines, solving the Diffie-Hellman problem, and any bijective mapping on a binary tape.
Mathematical methods in solutions of the problems from the Third International Students' Olympiad in Cryptography
TLDR
The mathematical problems and their solutions of the Third International Students' Olympiad in Cryptography NSUCRYPTO'2016 are presented and two open problems in mathematical cryptography are discussed and a solution for one of them proposed by a participant during the OlympiAD is described.
Problems and solutions from the fourth International Students’ Olympiad in Cryptography (NSUCRYPTO)
TLDR
This paper considers problems related to attacks on ciphers and hash functions, cryptographic Boolean functions, linear branch numbers, addition chains, and error correction codes, among others from the fourth International Students’ Olympiad in cryptography.
The Fifth International Students’ Olympiad in cryptography—NSUCRYPTO: Problems and their solutions
TLDR
Several open problems on orthogonal arrays, Sylvester matrices, and disjunct matrices are discussed, including the problem of existing an invertibleSylvester matrix whose inverse is again a Sylvesterster matrix.
On APN exponents, characterizations of differentially uniform functions by the Walsh transform, and related cyclic-difference-set-like structures
  • C. Carlet
  • Mathematics
    Des. Codes Cryptogr.
  • 2019
In this paper, we summarize the results obtained recently in three papers on differentially uniform functions in characteristic 2, and presented at the workshop WCC 2017 in Saint-Petersburg, and we
Generation of 8-Bit S-Boxes Having Almost Optimal Cryptographic Properties Using Smaller 4-Bit S-Boxes and Finite Field Multiplication
TLDR
A new construction is proposed for generating such 8-bit permutations with nonlinearity up to a value of 108 for S-Boxes with cryptographic properties close to optimal.
Applied cryptography - protocols, algorithms, and source code in C, 2nd Edition
On the classification of APN functions up to dimension five
TLDR
It is demonstrated that up to dimension 5 any APN function is CCZ equivalent to a power function, while it is well known that in dimensions 4 and 5 there exist APN functions which are not extended affine (EA) equivalent to any power function.
...
1
2
...