6 citations · 18 across the 10 of their papers we have counts for
10 papers
An upper bound on binomial coefficients in the de Moivre-Laplace form
Sergey Agievich
We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetri…
An overview of the Eight International Olympiad in Cryptography "Non-Stop University CRYPTO"
A. Gorodilova, N. Tokareva, S. Agievich +13
Non-Stop University CRYPTO is the International Olympiad in Cryptography that was held for the eight time in 2021. Hundreds of university and school students, professionals from 33…
The Seventh International Olympiad in Cryptography: problems and solutions
A. Gorodilova, N. Tokareva, S. Agievich +8
The International Olympiad in Cryptography NSUCRYPTO is the unique Olympiad containing scientific mathematical problems for professionals, school and university students from any c…
On the Sixth International Olympiad in Cryptography NSUCRYPTO
Anastasiya Gorodilova, Natalia Tokareva, Sergey Agievich +12
NSUCRYPTO is the unique cryptographic Olympiad containing scientific mathematical problems for professionals, school and university students from any country. Its aim is to involve…
The Fifth International Students' Olympiad in Cryptography -- NSUCRYPTO: problems and their solutions
Anastasiya Gorodilova, Sergey Agievich, Claude Carlet +10
Problems and their solutions of the Fifth International Students' Olympiad in cryptography NSUCRYPTO'2018 are presented. We consider problems related to attacks on ciphers and hash…
Problems and solutions of the Fourth International Students' Olympiad in Cryptography NSUCRYPTO
Anastasiya Gorodilova, Sergey Agievich, Claude Carlet +10
Mathematical problems and their solutions of the Fourth International Students' Olympiad in cryptography NSUCRYPTO'2017 are presented. We consider problems related to attacks on ci…