A. Gorodilova, N. Tokareva, S. Agievich, C. Carlet, V. Idrisova, K. Kalgin, D. Kolegov, A. Kutsenko, N. Mouha, M. Pudovkina, A. Udovenko
{"title":"第七届国际密码学奥林匹克竞赛:问题与对策","authors":"A. Gorodilova, N. Tokareva, S. Agievich, C. Carlet, V. Idrisova, K. Kalgin, D. Kolegov, A. Kutsenko, N. Mouha, M. Pudovkina, A. Udovenko","doi":"10.33048/semi.2021.18.063","DOIUrl":null,"url":null,"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.","PeriodicalId":45858,"journal":{"name":"Siberian Electronic Mathematical Reports-Sibirskie Elektronnye Matematicheskie Izvestiya","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2021-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The Seventh International Olympiad in Cryptography: Problems and solutions\",\"authors\":\"A. Gorodilova, N. Tokareva, S. Agievich, C. Carlet, V. Idrisova, K. Kalgin, D. Kolegov, A. Kutsenko, N. Mouha, M. Pudovkina, A. Udovenko\",\"doi\":\"10.33048/semi.2021.18.063\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":45858,\"journal\":{\"name\":\"Siberian Electronic Mathematical Reports-Sibirskie Elektronnye Matematicheskie Izvestiya\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2021-06-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Siberian Electronic Mathematical Reports-Sibirskie Elektronnye Matematicheskie Izvestiya\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33048/semi.2021.18.063\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Siberian Electronic Mathematical Reports-Sibirskie Elektronnye Matematicheskie Izvestiya","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33048/semi.2021.18.063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
The Seventh International Olympiad in Cryptography: Problems and solutions
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.