Title | ||
---|---|---|
Linear Complexity Of Quaternary Sequences Generated Using Generalized Cyclotomic Classes Modulo 2p |
Abstract | ||
---|---|---|
Let p be an odd prime number. We define a family of quaternary sequences of period 2p using generalized cyclotomic classes over the residue class ring modulo 2p. We compute exact values of the linear complexity, which are larger than half of the period. Such sequences are 'good' enough from the viewpoint of linear complexity. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1587/transfun.E94.A.1214 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
stream cipher, pseudorandom sequences, generalized cyclotomic sequences, quaternary sequences, linear complexity | Discrete mathematics,Affine cipher,Algebra,Modulo,Linear complexity,Pseudorandom generator theorem,Mathematics | Journal |
Volume | Issue | ISSN |
E94A | 5 | 0916-8508 |
Citations | PageRank | References |
5 | 0.51 | 7 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Xiaoni Du | 1 | 182 | 16.46 |
Zhixiong Chen | 2 | 148 | 28.47 |