|
This article is cited in 4 scientific papers (total in 4 papers)
An algorithm to restore a linear recurring sequence over the ring $R=\mathbf Z_{p^n}$ from a linear complication of its highest coordinate sequence
D. N. Bylkov, A. A. Nechaev
Abstract:
Let $u$ be a linear recurring sequence of maximal period over the ring $\mathbf Z_{p^n}$ and be a pseudo-random sequence over the field $\mathbf Z_p$ obtained by multiplying the highest coordinate sequence of $u$ by some polynomial. In this paper we analyse possibilities and ways to restore $u$ from a given $v$. A short survey of earlier results is given.
Received: 01.09.2010 Revised: 04.11.2010
Citation:
D. N. Bylkov, A. A. Nechaev, “An algorithm to restore a linear recurring sequence over the ring $R=\mathbf Z_{p^n}$ from a linear complication of its highest coordinate sequence”, Diskr. Mat., 22:4 (2010), 104–120; Discrete Math. Appl., 20:5-6 (2010), 591–609
Linking options:
https://www.mathnet.ru/eng/dm1122https://doi.org/10.4213/dm1122 https://www.mathnet.ru/eng/dm/v22/i4/p104
|
Statistics & downloads: |
Abstract page: | 598 | Full-text PDF : | 263 | References: | 47 | First page: | 25 |
|