On the uniformity of distribution of the Naor-Reingold pseudo-random function
From MaRDI portal
Publication:5941622
DOI10.1006/ffta.2000.0291zbMath0998.11041OpenAlexW2065295317MaRDI QIDQ5941622
Publication date: 20 August 2001
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/ffta.2000.0291
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Pseudo-random numbers; Monte Carlo methods (11K45) Special sequences (11K31)
Related Items (4)
Linear complexity 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 the distribution of the Diffie-Hellman pairs
Cites Work
- Linear complexity of the Naor-Reingold pseudo-random function
- On the Naor-Reingold pseudo-random function from elliptic curves
- Number-theoretic constructions of efficient pseudo-random functions
- Quasi-Monte Carlo methods and pseudo-random numbers
- Shifted primes without large prime factors
- New bounds for Gauss sums derived from KTH powers, and for Heilbronn's exponential sum
- Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression
- ON THE DISTRIBUTION OF DIGITS IN PERIODIC FRACTIONS
- On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the uniformity of distribution of the Naor-Reingold pseudo-random function