Name
Title | ||
|---|---|---|
Determining the k-error joint linear complexity spectrum for a binary multisequence with period p n |
Abstract | ||
|---|---|---|
Recent developments in word-based stream ciphers present the study on multi-sequences. The joint linear complexity and k-error joint linear complexity are fundamental concepts for the assessment of multisequences. The k-error joint linear complexity spectrum contains all the information about how the joint linear complexity of a multisequence decreases as the number k of allowed bit changes increases. In this paper, we present an efficient algorithm by which the k-error joint linear complexity spectrum for a t-fold p(n)-periodic binary multisequence can be entirely determined using O(tp(n) log p) bit operations, where p is an odd prime, 2 is a primitive root modulo p(2) and n is a positive integer. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s12095-015-0157-2 | CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES |
Keywords | Field | DocType |
Stream ciphers,Multisequence,Algorithm,Error joint linear complexity spectrum | Integer,Prime (order theory),Discrete mathematics,Combinatorics,Modulo,Stream cipher,Linear complexity,Mathematics,Primitive root modulo n,Binary number | Journal |
Volume | Issue | ISSN |
8.0 | 4 | 1936-2447 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| fulin li | 1 | 1 | 1.36 |
| Shixin Zhu | 2 | 216 | 37.61 |
| honggang hu | 3 | 0 | 0.34 |
| ting jiang | 4 | 0 | 0.34 |