Name
Abstract | ||
|---|---|---|
We discuss nonlinear vectorial primitive recursive sequences. First we consider the nonlinearly filtered multiple-recursive matrix generator for producing pseudorandom vectors based on some nonlinear schemes and give lower bounds for their componentwise linear complexity. Moreover, we obtain certain results concerning the jump multiple-recursive matrix generator and establish that sequences generated by them have better period and componentwise linear complexity as compared to usual multiple-recursive matrix generator sequences. We also include analogous results for transformation shift registers for generating pseudorandom vectors. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s12095-017-0265-2 | Cryptography and Communications |
Keywords | Field | DocType |
Multiple-recursive matrix generator, Transformation shift register, Linear complexity, 94A55, 94A60 | Discrete mathematics,Shift register,Generator matrix,Nonlinear system,Primitive recursive function,Linear complexity,μ operator,Jump,Mathematics,Pseudorandom number generator | Journal |
Volume | Issue | ISSN |
10 | 6 | 1936-2447 |
Citations | PageRank | References |
1 | 0.36 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sartaj Ul Hasan | 1 | 37 | 4.25 |
| Daniel Panario | 2 | 438 | 63.88 |
| Qiang Wang | 3 | 237 | 37.93 |