Name
Title | ||
|---|---|---|
Binary Threshold Sequences Derived From Carmichael Quotients With Even Numbers Modulus |
Abstract | ||
|---|---|---|
we define a family of 2(e+1)-periodic binary threshold sequences mid a family of p(2)-periodic binary threshold sequences by using Carmichael quotients modulo 2(e) (e > 2) and 2p (p is an odd prime), respectively. These are extensions of the construction derived from Fermat quotients modulo an odd prime in our earlier work. We determine exact values of the linear complexity, which are larger than half of the period. For cryptographic purpose, the linear complexities of the sequences in this letter are of desired values. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1587/transfun.E95.A.1197 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
Fermat quotients, Carmichael quotients, finite fields, binary threshold sequences, linear complexity | Discrete mathematics,China,Chinese academy of sciences,Linear complexity,Mathematics,Beijing,Binary number | Journal |
Volume | Issue | ISSN |
E95A | 7 | 0916-8508 |
Citations | PageRank | References |
3 | 0.40 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chenhuang Wu | 1 | 18 | 4.81 |
| Zhixiong Chen | 2 | 148 | 28.47 |
| Xiaoni Du | 3 | 182 | 16.46 |