Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\) (Q862718)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\) |
scientific article; zbMATH DE number 5118303
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\) |
scientific article; zbMATH DE number 5118303 |
Statements
Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\) (English)
0 references
24 January 2007
0 references
number theory of the finite field
0 references
cryptography
0 references
stream cipher
0 references
fast algorithm
0 references
0 references
0 references
0 references
0 references
0 references
