Name
Abstract | ||
|---|---|---|
We improve lower bounds on the k th-order nonlinear complexity of pseudorandom sequences over finite fields, including explicit inversive sequences and sequences obtained from Hermitian function fields, and we establish a probabilistic result on the behavior of the k th-order nonlinear complexity of random sequences over finite fields. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/TIT.2014.2343225 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
cryptography,probability,random sequences,Hermitian function fields,explicit inversive sequences,finite fields,maximum order complexity,nonlinear complexity,pseudorandom sequences,Linear complexity,maximum-order complexity,nonlinear complexity,pseudorandom sequence | Discrete mathematics,Nonlinear system,Computer science | Journal |
Volume | Issue | ISSN |
60 | 10 | 0018-9448 |
Citations | PageRank | References |
7 | 0.52 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Harald Niederreiter | 1 | 807 | 144.35 |
| Chaoping Xing | 2 | 916 | 110.47 |