|
This article is cited in 1 scientific paper (total in 1 paper)
Theoretical Foundations of Applied Discrete Mathematics
On local exponents of the mixing graphs for the functions realized by A5/1 type algorithms
S. N. Kyazhinab, V. M. Fomichevcd a Sociological Center of the Russian Federation Armed Forces, Moscow
b Faculty of Cybernetics and Information Security, National Engineering Physics Institute "MEPhI", Moscow
c Financial University under the Government of the Russian Federation, Moscow
d "Security Code", Moscow
Abstract:
It is shown that the mixing graphs for the functions realized by A5/1 type algorithms based on linear feedback shift registers of lengths $n,m,p$ with characteristic polynomials of weights $\nu,\mu,\pi$ are primitive. The following lower and upper bounds for the mixing graph exponent and local exponent depending on these parameters take place: $1+\max\{\lceil n/\nu\rceil,\lceil m/\mu\rceil,\lceil p/\pi\rceil\}\le\exp\Gamma\le\max\{n,m,p\}$. It is obtained that, for A5/1 algorithm, exponent $\exp\Gamma$ and local exponent $*J$-exp $\Gamma$, $J=\{1,20,42\}$, are equal to 21. This matches the idle running length of A5/1 generator.
Keywords:
A5/1 generator, primitive graph, exponent, local exponent.
Citation:
S. N. Kyazhin, V. M. Fomichev, “On local exponents of the mixing graphs for the functions realized by A5/1 type algorithms”, Prikl. Diskr. Mat. Suppl., 2015, no. 8, 11–13
Linking options:
https://www.mathnet.ru/eng/pdma226 https://www.mathnet.ru/eng/pdma/y2015/i8/p11
|
Statistics & downloads: |
Abstract page: | 193 | Full-text PDF : | 69 | References: | 71 |
|