References

  • Agievich, S., A. Gorodilova, V. Idrisova, N. Kolomeec, G. Shushuev, and N. Tokareva. 2017. Mathematical problems of the second international student’s Olympiad in cryptography. Cryptologia 41 (6):534–65. doi:10.1080/01611194.2016.1260666.
  • Agievich, S., A. Gorodilova, N. Kolomeec, S. Nikova, B. Preneel, V. Rijmen, G. Shushuev, N. Tokareva, and V. Vitkup. 2015. Problems, solutions and experience of the first international student’s Olympiad in cryptography. Prikladnaya Diskretnaya Matematika (Applied Discrete Mathematics) 29 (3):41–62. doi:10.17223/20710410/29/4
  • Agievich, S., V. Marchuk, A. Maslau, and V. Semenov. 2016. Bash-f: Another LRX sponge function. Report 2016/587, Cryptology ePrint Archive.
  • Geut, K., K. Kirienko, P. Sadkov, R. Taskin, and S. Titov. 2017. On explicit constructions for solving the problem “A secret sharing”. Prikladnaya Diskretnaya Matematika. Prilozhenie 10:68–70. doi:10.17223/2226308X/10/29.
  • Gorodilova, A., S. Agievich, C. Carlet, E. Gorkunov, V. Idrisova, N. Kolomeec, A. Kutsenko, S. Nikova, A. Oblaukhov, S. Picek, et al. 2019. Problems and solutions of the Fourth International Students Olympiad in Cryptography (NSUCRYPTO). Cryptologia 43 (2):138–74. doi:10.1080/01611194.2018.1517834.
  • Oblaukhov, A. 2019. A lower bound on the size of the largest metrically regular subset of the Boolean cube. Cryptography and Communications 11 (4):777–91. doi:10.1007/s12095-018-0326-1.
  • Picek, S., S. Guilley, C. Carlet, D. Jakobovic, and J. F. Miller. 2015. Evolutionary approach for finding correlation immune Boolean functions of order t with minimal Hamming weight. In Theory and practice of natural computing. Lecture notes in computer science, ed. A. H. Dediu, L. Magdalena, & C. Martn-Vide, vol. 9477, 71–82. Cham, Switzerland: Springer.
  • Tokareva, N., A. Gorodilova, S. Agievich, V. Idrisova, N. Kolomeec, A. Kutsenko, A. Oblaukhov, and G. Shushuev. 2018. Mathematical methods in solutions of the problems from the Third International Students’ Olympiad in Cryptography. Prikladnaya diskretnaya matematika 40:34–58. doi:10.17223/20710410/40/4.
  • Shangguan, C., and G. Ge. 2016. New bounds on the number of tests for disjunct matrices. IEEE Transactions on Information Theory 62 (12):7518–21. doi:10.1109/TIT.2016.2614726.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.