A pseudo-random function is a fundamental cryptographic primitive that is essential for encryption, identification, and authentication. We present a new cryptographic primitive called pseudo-random synthesizer and show how to use it in order to get a parallel construction of a pseudo-random function
On the Uniformity of Distribution of the Naor–Reingold Pseudo-Random Function
✍ Scribed by Igor E. Shparlinski
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 292 KB
- Volume
- 7
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
✦ Synopsis
We show that the new pseudo-random number function, introduced recently by M. Naor and O. Reingold, possesses one more attractive and useful property. Namely, it is proved that for almost all values of parameters it produces a uniformly distributed sequence. The proof is based on some recent bounds of character sums with exponential functions.
📜 SIMILAR VOLUMES
We show that, under some natural conditions, the pairs ðr; sÞ produced by the elliptic curve ElGamal signature scheme are uniformly distributed. In particular, this implies that values of r and s are not correlated. The result is based on some new estimates of exponential sums. For the ElGamal signa
## I. fntFoduction Let {X,,, n 2 1) be a sequence of independent random variables, P, and f, the distribution function and the characteristic fundion of the X,, respectively. Let us put SN = 2 X,, where N is a pasitive integer-valued random variable independent of X,, ?t 2 1. Furthermore, let { P,
We consider the distribution of alternation points in best real polynomial approximation of a function f # C[&1, 1]. For entire functions f we look for structural properties of f that will imply asymptotic equidistribution of the corresponding alternation points.