On the period of the Naor-Reingold sequence

DOI10.1016/J.IPL.2008.05.025zbMath1191.68283OpenAlexW2021923531MaRDI QIDQ975477

Álvar Ibeas Martín

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.05.025

zbMATH Keywords

cryptographypseudo-random numbers

Mathematics Subject Classification ID

Cryptography (94A60) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (3)

On the linear complexity of the Naor-Reingold sequence ⋮ Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions ⋮ On the linear complexity of the Naor-Reingold sequence with elliptic curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The period lengths of inversive pseudorandom vector generations
• On the Naor-Reingold pseudo-random function from elliptic curves
• Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
• Period of the power generator and small values of Carmichael’s function
• Number-theoretic constructions of efficient pseudo-random functions
• The period lengths of inversive congruential recursions
• On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves.

This page was built for publication: On the period of the Naor-Reingold sequence