Searcharxiv⌕ Search

arXiv subjects

Sergey Agievich

Publications and source records attributed to Sergey Agievich.

7 recordsLinked to original sources
arXiv2022

An upper bound on binomial coefficients in the de Moivre-Laplace form

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 continuations of a given Boolean function to bent functions, investigate dependencies into the Walsh-Hadamard spectra, obtain restrictions on the number of representations as sum of squares of integers bounded in magnitude.

math.CO↗
arXiv2020

On the Sixth International Olympiad in Cryptography NSUCRYPTO

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 modern cryptography. From the very beginning, the concept of the Olympiad was not to focus on solving olympic tasks but on including unsolved research problems at the intersection of mathematics and cryptography. The Olympiad history starts in 2014. In 2019, it was held for the sixth time. In this paper, problems and their solutions of the Sixth International Olympiad in cryptography NSUCRYPTO'2019 are presented. We consider problems related to attacks on ciphers and hash functions, protocols, Boolean functions, Dickson polynomials, prime numbers, rotor machines, etc. We discuss several open problems on mathematical countermeasures to side-channel attacks, APN involutions, S-boxes, etc. The problem of finding a collision for the hash function Curl27 was partially solved during the Olympiad.

cs.CR↗
arXiv2019

The Fifth International Students' Olympiad in Cryptography -- NSUCRYPTO: problems and their solutions

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 discuss several open problems on orthogonal arrays, Sylvester matrices and disjunct matrices. The problem of existing an invertible Sylvester matrix whose inverse is again a Sylvester matrix was completely solved during the Olympiad.

cs.CR↗
arXiv2018

Problems and solutions of the Fourth International Students' Olympiad in Cryptography NSUCRYPTO

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 branch number, addition chains, error correction codes, etc. We discuss several open problems on algebraic structure of cryptographic functions, useful proof-of-work algorithms, the Boolean hidden shift problem and quantum computings.

cs.CR↗
arXiv2008

Bent Rectangles

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 constructions, study partitions of a vector space into affine planes of the same dimension and use such partitions to build bent rectangles. We illustrate the concept of bent rectangles by examples for the Boolean case.

math.CO↗
arXiv2005

On the representation of bent functions by bent rectangles

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 functions, improve a lower bound for the number of bent functions.

math.CO↗