On the number of ℓ-suitable Boolean functions in constructions of filter and combining models of stream ciphers

Standard

On the number of ℓ-suitable Boolean functions in constructions of filter and combining models of stream ciphers. / Bonich, T. A.; Panferov, M. A.; Tokareva, N. N.

в: Прикладная дискретная математика, Том 62, 2023, стр. 21-28.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

BibTeX

@article{a8c06622ca1643f6941c8b3b98f8d469,

title = "On the number of ℓ-suitable Boolean functions in constructions of filter and combining models of stream ciphers",

abstract = "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.",

author = "Bonich, {T. A.} and Panferov, {M. A.} and Tokareva, {N. N.}",

note = "The work is supported by the Mathematical Center in Akademgorodok under the agreement No. 075-15-2022-282 with the Ministry of Science and Higher Education of the Russian Federation. Публикация для корректировки.",

year = "2023",

doi = "10.17223/20710410/62/3",

language = "English",

volume = "62",

pages = "21--28",

journal = "Прикладная дискретная математика",

issn = "2071-0410",

publisher = "Tomsk State University",

}

RIS

TY - JOUR

T1 - On the number of ℓ-suitable Boolean functions in constructions of filter and combining models of stream ciphers

AU - Bonich, T. A.

AU - Panferov, M. A.

AU - Tokareva, N. N.

N1 - The work is supported by the Mathematical Center in Akademgorodok under the agreement No. 075-15-2022-282 with the Ministry of Science and Higher Education of the Russian Federation. Публикация для корректировки.

PY - 2023

Y1 - 2023

N2 - 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.

AB - 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.

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-85184478229&origin=inward&txGid=687ae2ee348a1f46b5f2bf2ffc8f6543

UR - https://www.mendeley.com/catalogue/c09c69e2-ed98-3a0d-b6f0-50473d3d3d3a/

U2 - 10.17223/20710410/62/3

DO - 10.17223/20710410/62/3

M3 - Article

VL - 62

SP - 21

EP - 28

JO - Прикладная дискретная математика

JF - Прикладная дискретная математика

SN - 2071-0410

ER -

ID: 59663620