On the linear complexity of the Naor-Reingold sequence with elliptic curves

Authors:
Marcos Cruz;Domingo GóMez;Daniel Sadornil
Affiliations:
Departamento de Matemáticas Estadística y Computación, Universidad de Cantabria, Santander, Spain;Departamento de Matemáticas Estadística y Computación, Universidad de Cantabria, Santander, Spain;Departamento de Matemáticas Estadística y Computación, Universidad de Cantabria, Santander, Spain
Venue:
Finite Fields and Their Applications
Year:
2010

Citing 5
Cited 0

Linear complexity of the Naor-Reingold pseudo-random function

Information Processing Letters
On the Linear Complexity of the Naor–Reingold Pseudo-random Function from Elliptic Curves

Designs, Codes and Cryptography
Number-theoretic constructions of efficient pseudo-random functions

Journal of the ACM (JACM)
On the period of the Naor--Reingold sequence

Information Processing Letters
New directions in cryptography

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.