Register synthesis for algebraic feedback shift registers based on non-primes (Q1878294)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2093318
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Register synthesis for algebraic feedback shift registers based on non-primes |
scientific article; zbMATH DE number 2093318 |
Statements
Register synthesis for algebraic feedback shift registers based on non-primes (English)
0 references
19 August 2004
0 references
This paper deals with a synthesis problem for an extended class of algebraic feedback shift registers defined by \textit{A. Klapper} and \textit{J. Xu} [Theor. Comput. Sci. 226, No. 1--2, 61--92 (1999; Zbl 0965.94014); see also Proc. SETA `98, Discrete Mathematics and Theoretical Computer Science, 379--392 (1999; Zbl 1015.94540) and \textit{A. Klapper} and \textit{M. Goresky}, Lect. Notes Comput. Sci. 809, 174--178 (1994; Zbl 0943.94515), J. Cryptology 10, 111--147 (1997; Zbl 0874.94029)]. Several cases where the register synthesis problem can be solved by an efficient algorithm - the adequate modification of the Berlekamp-Massey algorithm - are discussed.
0 references
cryptography
0 references
feedback shift register
0 references
pseudorandom generator
0 references
stream cipher
0 references
register synthesis
0 references
N-adic numbers
0 references
Berlekamp-Massey algorithm
0 references
0.8332321047782898
0 references
0.8332321047782898
0 references
0.8294699192047119
0 references
