|
|||||
|
|
On the linear complexity of the Naor-Reingold sequence |
|
| Authors: | Domingo Gó mez,Á lvar Ibeas |
| Affiliation: | Universidad de Cantabria, Spain |
| Abstract: | We obtain a lower bound on the linear complexity of the Naor-Reingold sequence. This result solves an open problem proposed by Igor Shparlinski and improves known results in some cases. |
| Keywords: | Cryptography Pseudorandom numbers Linear complexity |
| 本文献已被 ScienceDirect 等数据库收录！ | |