Loading...
Please wait, while we are loading the content...
Similar Documents
Reducing the computation of linear complexities of periodic sequences over gf(p m) (2005).
| Content Provider | CiteSeerX |
|---|---|
| Author | Chen, Hao |
| Abstract | The linear complexity of a periodic sequence over GF(p m) play an important role in cryptography and communication([1]). In this correspondence, we prove a result which reduces the computation of the linear complexity and minimal connection polynomial of an arbitrary period un (where u p m −1,gcd(n,p m −1) = 1) sequence over GF(p m) to the computation of the linear complexities and minimal connection polynomials of u period n sequences over GF(p m). Some applications of this reduction in the fast algorithm for determining the linear complexity and minimal connection polynomials are presented. Index Terms—Berlekamp-Massey algorithm, Cryptography, Games-Chan algorithm, linear complexity, minimal connection polynomial, |
| File Format | |
| Publisher Date | 2005-01-01 |
| Access Restriction | Open |
| Subject Keyword | Linear Complexity Minimal Connection Polynomial Periodic Sequence Important Role Index Term Berlekamp-massey Algorithm Fast Algorithm Games-chan Algorithm Period Sequence Arbitrary Period Un |
| Content Type | Text |
