An overview of the Eight International Olympiad in Cryptography "Non-Stop University CRYPTO"

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

Reference : An overview of the Eight International Olympiad in Cryptography "Non-Stop University ...


	Document type :	E-prints/Working papers : Already available on another site
	Discipline(s) :	Engineering, computing & technology : Computer science
	Focus Areas :	Security, Reliability and Trust
	To cite this reference:	http://hdl.handle.net/10993/53225

Title :	An overview of the Eight International Olympiad in Cryptography "Non-Stop University CRYPTO"
Language :	English
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]
Publication date :	Apr-2022
Peer reviewed :	No
Keywords :	[en] 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.
Funders :	Sobolev Institute of Mathematics
Name of the research project :	FWNF-2022-0018
Target :	Researchers ; Professionals ; Students ; General public
Permalink :	http://hdl.handle.net/10993/53225
Other URL :	https://arxiv.org/abs/2204.11502
source URL :	https://arxiv.org/abs/2204.11502

There is no file associated with this reference.

All documents in ORBi^lu are protected by a user license.

University of Luxembourg Library | Feedback | Legal notices