On the number of l-suitable boolean functions in constructions of filter and combining models of stream ciphers

On the number of l-suitable boolean functions in constructions of filter and combining models of stream ciphers Full article

Journal

Прикладная дискретная математика (Prikladnaya Diskretnaya Matematika)
ISSN: 2071-0410 , E-ISSN: 2311-2263

Output data

Year: 2023, Volume: 62, Pages: 21-28 Pages count : 8 DOI: 10.17223/20710410/62/3

Funding (1)

Mathematical Center in Akademgorodok

075-15-2022-282

It is well known that every stream cipher is based on a good pseudorandom generator. For cryptographic purposes, we are interested in generating pseudorandom sequences with the maximum possible period. A feedback register is one of the most known cryptographic primitives that is used to construct stream ciphers. We consider periodic properties of pseudorandom sequences produced by filter and combiner generators (two known schemes of stream generators based on feedback registers). We analyze functions in these schemes that lead to output sequences of period at least a given number ℓ. We call such functions ℓ-suitable and count the exact number of them for an arbitrary n.

Bonich T.A. , Panferov M.A. , Tokareva N.N.
On the number of l-suitable boolean functions in constructions of filter and combining models of stream ciphers
Прикладная дискретная математика (Prikladnaya Diskretnaya Matematika). 2023. V.62. P.21-28. DOI: 10.17223/20710410/62/3 WOS Scopus РИНЦ OpenAlex

Submitted:	Nov 3, 2023
Published print:	Dec 25, 2023
Published online:	Dec 25, 2023

Web of science:	WOS:001424879000003
Scopus:	2-s2.0-85184478229
Elibrary:	55082636
OpenAlex:	W4403340167

Пока нет цитирований