Recommendations
- On the linear complexity of the Naor-Reingold sequence
- scientific article; zbMATH DE number 1424198
- scientific article; zbMATH DE number 26870
- On the Multidimensional Distribution of the Naor–Reingold Pseudo-Random Function
- On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves.
Cites work
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 732318 (Why is no real title available?)
- scientific article; zbMATH DE number 1982610 (Why is no real title available?)
- scientific article; zbMATH DE number 1790427 (Why is no real title available?)
- scientific article; zbMATH DE number 910950 (Why is no real title available?)
- Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
- Number-theoretic constructions of efficient pseudo-random functions
- On the Naor-Reingold pseudo-random function from elliptic curves
- On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves.
- Period of the power generator and small values of Carmichael's function
- Pseudorandom sequences
- The period lengths of inversive congruential recursions
- The period lengths of inversive pseudorandom vector generations
Cited in
(5)- On the linear complexity of the Naor-Reingold sequence with elliptic curves
- Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions
- On the linear complexity of the Naor-Reingold sequence
- scientific article; zbMATH DE number 5036183 (Why is no real title available?)
- On linear recurrence sequences with polynomial coefficients
This page was built for publication: On the period of the Naor-Reingold sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975477)
