Name
Title | ||
|---|---|---|
Linear Complexity Over F-Q Of Generalized Cyclotomic Quaternary Sequences With Period 2p |
Abstract | ||
|---|---|---|
Let r be an odd prime, such that r >= 5 and r not equal p, m be the order of r modulo p. Then, there exists a 2pth root of unity in the extension field F(r)m. Let G(x) be the generating polynomial of the considered quaternary sequences over F-q[x] with q = r(m). By explicitly computing the number of zeros of the generating polynomial G(x) over F(r)m, we can determine the degree of the minimal polynomial, of the quaternary sequences which in turn represents the linear complexity. In this paper, we show that the minimal value of the linear complexity is equal to 1/2(3p - 1) which is more than p, the half of the period 2p. According to Berlekamp-Massey algorithm, these sequences viewed as enough good for the use in cryptography. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1587/transfun.E98.A.1569 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | DocType | Volume |
linear complexity, generalized cyclotomic sequences, quaternary sequences, stream cipher, generating polynomial | Journal | E98A |
Issue | ISSN | Citations |
7 | 0916-8508 | 1 |
PageRank | References | Authors |
0.36 | 10 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| minglong qi | 1 | 1 | 0.36 |
| Shengwu Xiong | 2 | 189 | 53.59 |
| Jingling Yuan | 3 | 84 | 17.93 |
| wenbi rao | 4 | 1 | 0.36 |
| Luo Zhong | 5 | 12 | 9.08 |