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, “The Seventh International Olympiad in Cryptography: problems and solutions”, Сиб. электрон. матем. изв., 2021, том 18, выпуск 2,страницы А.4

Эта публикация цитируется в 2 статьях

Математическая жизнь

The Seventh International Olympiad in Cryptography: problems and solutions

A. A. Gorodilova^a, N. N. Tokareva^ab, S. V. Agievich^c, C. Carlet^d, V. A. Idrisova^a, K. V. Kalgin^ae, D. N. Kolegov^f, A. V. Kutsenko^ae, N. Mouha^g, M. A. Pudovkina^h, A. N. Udovenkoⁱ

^a Sobolev Institute of Mathematics, 4, Koptyuga ave., Novosibirsk, 630090, Russia
^b Laboratory of Cryptography JetBrains Research, 1, Pirogova str., Novosibirsk, 630090, Russia
^c Belarusian State University, 4, Nezavisimosti ave., Minsk, 220030, Belarus
^d University of Paris 8, 2 rue de la Liberté, Saint-Denis, 93526, France
^e Novosivirsk State University, 1, Pirogova str., Novosibirsk, 630090, Russia
^f Tomsk State University, 36, Lenin ave., Tomsk, 634050, Russia
^g National Institute of Standards and Technology, 100, Bureau Drive, Gaithersburg, 20899, USA
^h Bauman Moscow State Technical University, 5/1, Baumanskaya 2-ya str., Moscow, 105005, Russia
ⁱ CryptoExperts, 41, Boulevard des Capucines, Paris, 75002, France

Аннотация: 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.

Ключевые слова: cryptography, hash functions, CPA game, orthomorphisms, bases, primality tests, AES, steganography, Olympiad, NSUCRYPTO.

УДК: 519.7

MSC: 06E30, 11T71, 14G50

Поступила 31 мая 2021 г., опубликована 21 июля 2021 г.

Язык публикации: английский

DOI: 10.33048/semi.2021.18.063