The Seventh International Olympiad in Cryptography: Problems and solutions

  title={The Seventh International Olympiad in Cryptography: Problems and solutions},
  author={Anastasiya Gorodilova and Natalia N. Tokareva and Sergey Agievich and Claude Carlet and Valeriya Idrisova and Konstantin Kalgin and Denis Kolegov and Alexandr Kutsenko and Nicky Mouha and Marina Pudovkina and Aleksei Udovenko},
  journal={Sibirskie Elektronnye Matematicheskie Izvestiya},
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 and diplomas were awarded to 84 participants in the first round and 49 teams in the second round from 32 countries. In this paper, problems and… 

Figures and Tables from this paper

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

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.



On the nonexistence of certain orthogonal arrays of strength four

Дано решение открытой проблемы олимпиады по криптографии NSUCRYPTO-2018: показано, что не существует ортогональных массивов OA (16L, 11, 2, 4) с L = 6 и 7. Этот результат позволяет определить

On the Sixth International Olympiad in Cryptography NSUCRYPTO

The problem of finding a collision for the hash function Curl27 was partially solved during the Olympiad and several open problems on mathematical countermeasures to side-channel attacks, APN involutions, S-boxes, etc are discussed.

The Fifth International Students’ Olympiad in cryptography—NSUCRYPTO: Problems and their solutions

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.

Problems and solutions from the fourth International Students’ Olympiad in Cryptography (NSUCRYPTO)

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.

Mathematical problems of the Second International Students’ Olympiad in Cryptography

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

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.

Nonce-Disrespecting Adversaries: Practical Forgery Attacks on GCM in TLS

An Internet-wide scan identified 184 HTTPS servers repeating nonces, which fully breaks the authenticity of the connections, and over 70,000 HTTPS servers using random nonces are discovered, which puts them at risk of nonce reuse.

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

SP 800-38D. Recommendation for Block Cipher Modes of Operation: Galois/Counter Mode (GCM) and GMAC

This Recommendation specifies the Galois/Counter Mode (GCM), an algorithm for authenticated encryption with associated data, and its specialization, GMAC, for generating a message authentication code