On the number of unsuitable boolean functions in constructions of filter and combining models of stream ciphers T. A. Bonich, M. A. Panferov, N. N. Tokareva
Material type:
ArticleSubject(s): потоковые шифры | генератор фильтров | булевы функцииGenre/Form: статьи в журналах Online resources: Click here to access online
In:
Прикладная дискретная математика. Приложение № 13. С. 78-80Abstract: 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.
Библиогр.: 7 назв.
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.
There are no comments on this title.