第七届国际密码学奥林匹克竞赛:问题与对策

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":" ","pages":""},"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\":\" \",\"pages\":\"\"},\"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}
引用次数: 2

摘要

国际密码学奥林匹克运动会NSUCRYPTO是一个独特的奥林匹克运动会,为来自任何国家的专业人士、中小学生和大学生提供科学数学问题。其目的是让年轻的研究人员参与解决现代密码学中好奇而棘手的科学问题。2020年,它举行了第七次。来自32个国家的84名第一轮参赛者和49支第二轮参赛队伍获得了奖品和文凭。本文介绍了NSUCRYPTO’2020存在的问题及其解决方案。我们考虑了与攻击密码和散列函数、协议、排列、素性测试等有关的问题。我们讨论了JPEG编码、Miller-Rabin素性测试、向量空间中的特殊基、AES-GCM等方面的几个开放问题。在奥林匹克运动会期间,一个改良的米勒-拉宾素性测试的问题得到了解决。找到特殊基地的问题得到了部分解决。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.00
自引率
25.00%
发文量
15
期刊最新文献
Optimal control of thin elastic inclusion in an elastic body Capacities of generalized condensers with $A_1$-Muckenhoupt weight One necessary condition for the regularity of a $p$-group and its application to Wehrfritz's problem Properties of ranks for families of strongly minimal theories Optimal discrete Neumann energy in a ball and an annulus
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1