Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Agievich, Sergey"'
Autor:
Agievich, Sergey
Publikováno v:
Journal of the Belarusian State University. Mathematics and Informatics. 2022. 1:66-74. In Russian
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 symmetric binomial distribution. Using the bound, we estimate the number of co
Externí odkaz:
http://arxiv.org/abs/2205.07120
Autor:
Gorodilova, Anastasiya, Tokareva, Natalia, Agievich, Sergey, Carlet, Claude, Gorkunov, Evgeny, Idrisova, Valeria, Kolomeec, Nikolay, Kutsenko, Alexander, Lebedev, Roman, Nikova, Svetla, Oblaukhov, Alexey, Pankratova, Irina, Pudovkina, Marina, Rijmen, Vincent, Udovenko, Aleksei
NSUCRYPTO is the unique cryptographic 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
Externí odkaz:
http://arxiv.org/abs/2005.09563
Autor:
Gorodilova, Anastasiya, Agievich, Sergey, Carlet, Claude, Hou, Xiang-dong, Idrisova, Valeriya, Kolomeec, Nikolay, Kutsenko, Alexandr, Mariot, Luca, Oblaukhov, Alexey, Picek, Stjepan, Preneel, Bart, Rosie, Razvan, Tokareva, Natalia
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 functions, Boolean functions, quantum circuits, Enigma, etc. We discu
Externí odkaz:
http://arxiv.org/abs/1906.04480
Autor:
Gorodilova, Anastasiya, Agievich, Sergey, Carlet, Claude, Gorkunov, Evgeny, Idrisova, Valeriya, Kolomeec, Nikolay, Kutsenko, Alexandr, Nikova, Svetla, Oblaukhov, Alexey, Picek, Stjepan, Preneel, Bart, Rijmen, Vincent, Tokareva, Natalia
Mathematical problems and their solutions of the Fourth International Students' Olympiad in cryptography NSUCRYPTO'2017 are presented. We consider problems related to attacks on ciphers and hash functions, cryptographic Boolean functions, the linear
Externí odkaz:
http://arxiv.org/abs/1806.02059
Autor:
Agievich, Sergey
We study generalized regular bent functions using a representation by bent rectangles, that is, special matrices with restrictions on rows and columns. We describe affine transformations of bent rectangles, propose new biaffine and bilinear construct
Externí odkaz:
http://arxiv.org/abs/0804.0209
Autor:
Agievich, Sergey, Solovey, Oleg
Publikováno v:
Computer Data Analysis and Modeling: Proceedings of the 7th International Conference (September 6-10, 2004, Minsk), Vol. 1, P. 283-287, 2004
We consider a self-decimated generator of pseudorandom numbers and examine the preperiod $\lambda$ and the period $\mu$ of its state sequence. We obtain the expectations and variances of $\lambda$ and $\mu$ for the case when decimation steps are chos
Externí odkaz:
http://arxiv.org/abs/math/0505660
Autor:
Agievich, Sergey
Publikováno v:
Probabilistic Methods in Discrete Mathematics: Proceedings of the Fifth International Petrozavodsk Conference (Petrozavodsk, June 1-6, 2000). Utrecht, Boston: VSP, pp.121-135, 2002
We propose a representation of boolean bent functions by bent rectangles, that is, by special matrices with restrictions on rows and columns. Using this representation, we exhibit new classes of bent functions, give an algorithm to construct bent fun
Externí odkaz:
http://arxiv.org/abs/math/0502087
Autor:
Gorodilova, Anastasiya, Agievich, Sergey, Carlet, Claude, Hou, Xiang-dong, Idrisova, Valeria, Kolomeec, Nikolay, Kutsenko, Alexandr, Mariot, Luca, Oblaukhov, Alexey, Picek, Stjepan, Preneel, Bart, Rosie, Razvan, Tokareva, Natalia
Publikováno v:
Cryptologia; May2020, Vol. 44 Issue 3, p223-256, 34p
