Name
Abstract | ||
|---|---|---|
An efficient algorithm for determining the linear complexity and the minimal polynomial of sequence with period pmqn over a finite field GF(q) is designed, where p andq are primes, and q is a primitive root modulo p2. The new algorithm generalizes the algorithm for computing the linear complexity of sequences with period qn over GF(q) and that for computing the linear complexity of sequences with period pm over GF(q). |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11599548_17 | information security and cryptology |
Keywords | DocType | Volume |
primitive root modulo p2,period pm,linear complexity,finite field,p andq,period qn,fast algorithm,new algorithm,periodic sequence,minimal polynomial,efficient algorithm,period pmqn | Journal | abs/cs/0512040 |
Issue | ISSN | ISBN |
null | 0302-9743 | 3-540-30855-5 |
Citations | PageRank | References |
1 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shimin Wei | 1 | 45 | 10.80 |
| Guolong Chen | 2 | 52 | 11.10 |
| GuoZhen Xiao | 3 | 239 | 28.18 |