Name
Title | ||
|---|---|---|
The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation. |
Abstract | ||
|---|---|---|
Pseudo-random sequences with good statistical properties, such as low autocorrelation, high linear complexity and large 2-adic complexity, have been used in designing reliable stream ciphers. In this paper, we obtain the exact autocorrelation distribution of a class of binary sequences with three-level autocorrelation and analyze the 2-adic complexity of this class of sequences. Our results show that the 2-adic complexity of such a binary sequence with period is at least ( + 1) − log ( + 1). We further show that it is maximal for infinitely many cases. This indicates that the 2-adic complexity of this class of sequences is large enough to resist the attack of the rational approximation algorithm (RAA) for feedback with carry shift registers (FCSRs). |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s12095-017-0233-x | Cryptography and Communications |
Keywords | Field | DocType |
Stream ciphers,Pseudo-random sequences,Autocorrelation,2-adic complexity,94A55,94A60,65C10 | Approximation algorithm,Discrete mathematics,Combinatorics,Autocorrelation technique,Autocorrelation matrix,Pseudorandom binary sequence,Complementary sequences,Stream cipher,Mathematics,Autocorrelation,Binary number | Journal |
Volume | Issue | ISSN |
10 | 3 | 1936-2447 |
Citations | PageRank | References |
1 | 0.41 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuhua Sun | 1 | 2 | 3.81 |
| Qiang Wang | 2 | 237 | 37.93 |
| Tongjiang Yan | 3 | 87 | 19.48 |