3 research outputs found
On the Sixth International Olympiad in Cryptography NSUCRYPTO
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. In 2019, it was held for the
sixth time. In this paper, problems and their solutions of the Sixth
International Olympiad in cryptography NSUCRYPTO'2019 are presented. We
consider problems related to attacks on ciphers and hash functions, protocols,
Boolean functions, Dickson polynomials, prime numbers, rotor machines, etc. We
discuss several open problems on mathematical countermeasures to side-channel
attacks, APN involutions, S-boxes, etc. The problem of finding a collision for
the hash function Curl27 was partially solved during the Olympiad
An overview of the Eight International Olympiad in Cryptography "Non-Stop University CRYPTO"
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