|
This article is cited in 1 scientific paper (total in 1 paper)
Mathematical Methods of Cryptography
On the number of unsuitable Boolean functions in constructions of filter and combining models of stream ciphers
T. A. Bonichab, M. A. Panferovba, N. N. Tokarevaca a Novosibirsk State University
b JetBrains Research
c Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Abstract:
It is well known that every stream cipher is based on a good pseudorandom generator. For cryptographic purposes, we are interested in generation of pseudorandom sequences of the maximal possible period. A feedback register is one of the most known cryptographic primitives that is used in construction of stream generators. We analyze periodic properties of pseudorandom sequences produced by filter and combiner generators equipped with nonlinear Boolean functions. We determine which nonlinear functions in these schemes lead to pseudorandom sequences of not maximal possible period. We call such functions unsuitable and count the exact number of them for an arbitrary $n$.
Keywords:
stream cipher, filter generator, combiner generator, gamma, Boolean function.
Citation:
T. A. Bonich, M. A. Panferov, N. N. Tokareva, “On the number of unsuitable Boolean functions in constructions of filter and combining models of stream ciphers”, Prikl. Diskr. Mat. Suppl., 2020, no. 13, 78–80
Linking options:
https://www.mathnet.ru/eng/pdma503 https://www.mathnet.ru/eng/pdma/y2020/i13/p78
|
Statistics & downloads: |
Abstract page: | 137 | Full-text PDF : | 59 | References: | 23 |
|