On the linear complexity of the Naor–Reingold sequence with elliptic curves |
| |
| Authors: | Marcos Cruz Domingo Gómez Daniel Sadornil |
| |
| Institution: | Departamento de Matemáticas Estadística y Computación, Universidad de Cantabria, Santander, Spain |
| |
| Abstract: | The Naor–Reingold sequences with elliptic curves are used in cryptography due to their nice construction and good theoretical properties. Here we provide a new bound on the linear complexity of these sequences. Our result improves the previous one obtained by I.E. Shparlinski and J.H. Silverman and holds in more cases. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
