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

DOI10.1016/j.ffa.2010.05.005zbMath1248.11053OpenAlexW2009308345MaRDI QIDQ708437

Marcos Cruz, Daniel Sadornil, Domingo Gomez

Publication date: 11 October 2010

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2010.05.005

zbMATH Keywords

elliptic curveslinear complexityNaor-Reingold pseudo-random function

Mathematics Subject Classification ID

Cryptography (94A60) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (5)

Polynomial interpolation of the Naor-Reingold pseudo-random function ⋮ On the Multidimensional Distribution of the Naor–Reingold Pseudo-Random Function ⋮ On the linear complexity of the Naor-Reingold sequence ⋮ On lattice profile of the elliptic curve linear congruential generators ⋮ Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions

Cites Work

• Linear complexity of the Naor-Reingold pseudo-random function
• On the period of the Naor-Reingold sequence
• On the Naor-Reingold pseudo-random function from elliptic curves
• Number-theoretic constructions of efficient pseudo-random functions
• New directions in cryptography
• Character sums with exponential functions
• Progress in Cryptology - INDOCRYPT 2003
• On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves.
• Unnamed Item
• Unnamed Item

This page was built for publication: On the linear complexity of the Naor-Reingold sequence with elliptic curves