No full text
Eprint already available on another site (E-prints, Working papers and Research blog)
An overview of the Eight International Olympiad in Cryptography "Non-Stop University CRYPTO"
Gorodilova, Anastasiya; Tokareva, Natalia; Agievich, Sergey et al.
2022
 

Files


Full Text
No document available.

Send to



Details



Keywords :
cryptography; ciphers; masking; quantum error correction; electronic voting; permutations; s-Boolean sharing; orthogonal arrays; Olympiad; NSUCRYPTO
Abstract :
[en] 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 cryptography. In this paper, problems and their solutions of the Olympiad’2021 are presented. We consider 19 problems of varying difficulty and topics: ciphers, online machines, passwords, binary strings, permutations, quantum circuits, historical ciphers, elliptic curves, masking, implementation on a chip, etc. We discuss several open problems on quantum error correction, finding special permutations and s-Boolean sharing of a function, obtaining new bounds on the distance to affine vectorial functions.
Disciplines :
Computer science
Author, co-author :
Gorodilova, Anastasiya
Tokareva, Natalia
Agievich, Sergey
Beterov, Ilya
Beyne, Tim
Budaghyan, Lilya
Carlet, Claude
Dhooghe, Siemen
Idrisova, Valeria
Kolomeec, Nikolay
Kutsenko, Aleksandr
Malygina, Ekaterina
Mouha, Nicky
Pudovkina, Marina
Sica, Francesco
Udovenko, Aleksei  ;  CryptoExperts, Paris, France
More authors (6 more) Less
Language :
English
Title :
An overview of the Eight International Olympiad in Cryptography "Non-Stop University CRYPTO"
Publication date :
April 2022
Focus Area :
Security, Reliability and Trust
Name of the research project :
FWNF-2022-0018
Funders :
Sobolev Institute of Mathematics
Available on ORBilu :
since 19 December 2022

Statistics


Number of views
31 (0 by Unilu)
Number of downloads
0 (0 by Unilu)

Bibliography


Similar publications



Contact ORBilu