The seventh International Olympiad in Cryptography: problems and solutions

A. A. Gorodilova, N. N. Tokareva, S. V. Agievich, C. Carlet, V. A. Idrisova, K. V. Kalgin, D. N. Kolegov, A. V. Kutsenko, N. Mouha, M. A. Pudovkina, A. N. Udovenko

Research output: Contribution to journalArticlepeer-review

Abstract

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 their solutions of NSUCRYPTO’2020 are presented. We consider problems related to attacks on ciphers and hash functions, protocols, permutations, primality tests, etc. We discuss several open problems on JPEG encoding, Miller — Rabin primality test, special bases in the vector space, AES-GCM. The problem of a modified Miller — Rabin primality test was solved during the Olympiad. The problem for finding special bases was partially solved.

Original languageEnglish
Article number26
Pages (from-to)4-29
Number of pages26
JournalSiberian Electronic Mathematical Reports
Volume18
Issue number2
DOIs
Publication statusPublished - 2021

OECD FOS+WOS

  • 1.01 MATHEMATICS

Fingerprint

Dive into the research topics of 'The seventh International Olympiad in Cryptography: problems and solutions'. Together they form a unique fingerprint.

Cite this