Name
Abstract | ||
|---|---|---|
One of the most interesting themes in cryptology is the generating of the highly unpredictable pseudo-random sequences. Unfortunately, it is difficult even to define what the highly unpredictable pseudo-random sequences are. However, some measures for the unpredictability, or equivalently the randomness, of finite sequences were proposed. The linear complexity is one of such measures. We present new classes of sequences with the interesting growth property of linear complexity. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0020-0190(92)90190-7 | Inf. Process. Lett. |
Keywords | Field | DocType |
linear complexity,finite sequence,perfect staircase profile,theory of computation,randomness,data structures | Pseudo random sequence,Discrete mathematics,Data structure,Shift register,Combinatorics,Cryptography,Random sequence,Algorithm,Linear complexity,Mathematics,Randomness,Theory of computation | Journal |
Volume | Issue | ISSN |
44 | 2 | 0020-0190 |
Citations | PageRank | References |
3 | 1.17 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masakatu Morii | 1 | 191 | 39.72 |
| Masao Kasahara | 2 | 290 | 147.60 |