On the number of l-suitable boolean functions in constructions of filter and combining models of stream ciphers | Sciact - Система учета научной деятельности ИМ СО РАН

On the number of l-suitable boolean functions in constructions of filter and combining models of stream ciphers Научная публикация

Журнал

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

Вых. Данные

Год: 2023, Том: 62, Страницы: 21-28 Страниц : 8 DOI: 10.17223/20710410/62/3

Ключевые слова

stream cipher, filter generator, combiner generator, Boolean function

Авторы

Bonich T.A. ¹ , Panferov M.A. ^1,2 , Tokareva N.N. ¹

Организации

1	Novosibirsk State University
2	Sobolev Institute of Mathematics

Информация о финансировании (1)

Математический центр в Академгородке

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

Поступила в редакцию:	3 нояб. 2023 г.
Опубликована в печати:	25 дек. 2023 г.
Опубликована online:	25 дек. 2023 г.

Web of science:	WOS:001424879000003
Scopus:	2-s2.0-85184478229
РИНЦ:	55082636
OpenAlex:	W4403340167

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