Draft:NSUCRYPTO
 | Draft article not currently submitted for review.
This is a draft Articles for creation (AfC) submission. It is not currently pending review. While there are no deadlines, abandoned drafts may be deleted after six months. To edit the draft click on the "Edit" tab at the top of the window. To be accepted, a draft should:
It is strongly discouraged to write about yourself, your business or employer. If you do so, you must declare it. Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
Last edited by FrescoBot (talk | contribs) 16 days ago. (Update) |
Non-Stop University CRYPTO (NSUCRYPTO) is an international olympiad in cryptography for school students, university students and professionals. The first NSUCRYPTO was held in Novosibirsk, Russia, in 2014. It has since been held annually, with several thousands of participants from more than 50 countries overall.
In 2025 the olympiad will take place from October 12th to October 20th.[1]
History
[edit]The first NSUCRYPTO was held in Novosibirsk, Russia, in 2014, and gathered participants from several Russian cities, as well as teams from Belgium, Belarus, and Bulgaria.[2] During the first ten years (2014-2023) more than 3000 participants from more than 50 countries took part in the olympiad.
Every year after the olympiad, an article is published with an analysis of the problems and their best solutions.[3][4][5][6][7][8][9][10][11]
Rules, scoring and format
[edit]The olympiad is held online and has two independent rounds: the first round lasts 4.5 hours and is designed for individual participation in one of three possible categories: school students, university students, and professionals.[12] The second round involves team participation (up to three members), lasts for a week, and follows the same categories. The category for a team is defined by the highest category of all team members to prevent professionals from competing among school or university students. Participants of the "students" and "professional" categories share the same problem pool in both rounds, but compete strictly among themselves.
The participation is always free of charge and is not constrained by age, occupation, or citizenship. To participate, one should register on NSUCRYPTO website, choose their category and then start solving the problems on the olympiad schedule. All problems are stated in English and become public only on the round start. The solutions are uploaded on the website in any convenient format (.txt, .pdf, .jpg, .cpp, .docx, etc.).
Once both of rounds are finished, the solutions provided by participants are distributed among jury members in an anonymised form, and then re-distributed again for second review. After pre-publishing of the results there is a short time period for the appeal process.
Participants, who take the first, the second, or the third place, or who provided partial or full solution for an unsolved problem, are awarded with diplomas and prizes. Those, whose score was close to the third place, receive honourable diplomas.
Types of problems
[edit]The range of topics of olympiad problems varies greatly: there were problems on classical cryptographic primitives and algorithms, well-known and new ciphers, online cipher machines, discrete functions, cryptographic protocols, post-quantum schemes and algorithms, elliptic curves and error-correcting codes, blockchain systems and cryptocurrencies, elements of steganography and masking, cryptanalysis methods, issues of implementing cryptographic algorithms.
Traditionally, the second round of the olympiad offers, along with the usual problems, that have solution(s), several unsolved problems that require careful research. Some of these problems remain unsolved, while the others become fully or partially solved during the olympiad. There are several articles on solutions of the open problems stated as olympiad problems.[13][14][15]
Organizers and partners
[edit]The Olympiad is held with the support of several universities from different countries and companies specializing in cryptography and information security. In 2025 the partners of the olympiad are Cryptographic Center (Novosibirsk), National Technology Center for Digital Cryptography, Novosibirsk State University, Kryptonite, AKTIV company, KU Leuven, Southern Federal University, InfoTeCs, Kovalevskaya North-West Center of Mathematical Research, Belarusian State University, Tomsk State University, Nsucrypto-lab.
Program committee of NSUCRYPTO consists of specialists in the fields of cryptography, computer science and information security, working in research institutes or industry.[16]
Links
[edit]Official site of NSUCRYPTO
References
[edit]- ^ https://nsucrypto.nsu.ru/
- ^ https://nsucrypto.nsu.ru/archive/2014/total_results/round/2/#data
- ^ Agievich S., Gorodilova A., Kolomeec N., Nikova S., Preneel B., Rijmen V., Shushuev G., Tokareva N., Vitkup V. (2015). "Problems, solutions and experience of the first international student's Olympiad in cryptography". Prikladnaya Diskretnaya Matematika (Applied Discrete Mathematics). 29 (3): 41–62.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - ^ Agievich S., Gorodilova A., Idrisova V., Kolomeec N., Shushuev G., Tokareva N. (2017). "Mathematical problems of the second international student's Olympiad in cryptography". Cryptologia. 41 (6): 534–565.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - ^ Tokareva N., Gorodilova A., Agievich S., Idrisova V., Kolomeec N., Kutsenko A., Oblaukhov A., Shushuev G. (2018). "Mathematical methods in solutions of the problems from the Third International Students' Olympiad in Cryptography". Prikladnaya Diskretnaya Matematika (Applied Discrete Mathematics). 40: 34–58. doi:10.17223/20710410/40/4.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - ^ Gorodilova A., Agievich S., Carlet C., Gorkunov E., Idrisova V., Kolomeec N., Kutsenko A., Nikova S., Oblaukhov A., Picek S., Preneel B., Rijmen V., Tokareva N. (2019). "Problems and solutions of the Fourth International Students' Olympiad in Cryptography (NSUCRYPTO)". Cryptologia. 43 (2): 138–174. doi:10.1080/01611194.2018.1517834.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - ^ Gorodilova A., Agievich S., Carlet C., Hou X., Idrisova V., Kolomeec N., Kutsenko A., Mariot L., Oblaukhov A., Picek S., Preneel B., Rosie R., Tokareva N. (2020). "The Fifth International Students' Olympiad in Cryptography - NSUCRYPTO: problems and their solutions". Cryptologia. 44 (3): 223–256. doi:10.1080/01611194.2019.1670282.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - ^ Gorodilova A., Tokareva N., Agievich S., Carlet C., Gorkunov E., Idrisova V., Kolomeec N., Kutsenko A., Lebedev R., Nikova S., Oblaukhov A., Pankratova I., Pudovkina M., Rijmen V., Udovenko A. (2020). "On the Sixth International Olympiad in Cryptography NSUCRYPTO". Journal of Applied and Industrial Mathematics. 14 (4): 623–647. doi:10.1134/S1990478920040031.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - ^ Gorodilova A., Tokareva N., Agievich S., Carlet C., Idrisova V., Kalgin K., Kolegov D., Kutsenko A., Mouha N., Pudovkina M., Udovenko A. (2021). "The Seventh International Olympiad in Cryptography: problems and solutions". Siberian Electronic Mathematical Reports. 18 (2): A4 – A29. doi:10.33048/semi.2021.18.063.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - ^ Gorodilova A., Tokareva N., Agievich S., Beterov I., Beyne T., Budaghyan L., Carlet C., Dhooghe S., Idrisova V., Kolomeec N., Kutsenko A., Malygina E., Mouha N., Pudovkina M., Sica F., Udovenko A. (2022). "An overview of the Eight International Olympiad in Cryptography "Non-Stop University CRYPTO"". Siberian Electronic Mathematical Reports. 19 (1): A9 – A37. doi:10.33048/semi.2022.19.023.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - ^ Idrisova V.A., Tokareva N.N., A. A. Gorodilova, I. I. Beterov, T. A. Bonich, E. A. Ishchukova, N. A. Kolomeec, A. V. Kutsenko, E. S. Malygina, I. A. Pankratova, M. A. Pudovkina, A. N. Udovenko (2023). "Mathematical problems and solutions of the Ninth International Olympiad in cryptography NSUCRYPTO". Prikladnaya Diskretnaya Matematika (Applied Discrete Mathematics). 4: 29–54.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - ^ https://nsucrypto.nsu.ru/outline/
- ^ Геут К.Л., Кириенко К.А., Садков П.О., Таскин Р.И., Титов С.С. (2017). "О явных конструкциях для решения задачи "A secret sharing"". Прикладная дискретная математика. Приложение (in Russian). 10: 68–70. doi:10.17223/2226308X/10/29.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - ^ Ayat S., Ghahramani M. (2019). "A recursive algorithm for solving "a secret sharing" problem". Cryptologia. 43 (6): 497–503. doi:10.1080/01611194.2019.1596996.
- ^ Kiss R., Nagy G. P. (2021). "On the nonexistence of certain orthogonal arrays of strength four". Prikladnaya Diskretnaya Matematika (Applied Discrete Mathematics). 52: 65–68. doi:10.17223/20710410/52/3.
- ^ https://nsucrypto.nsu.ru/committees-sponsors/