Non-linear Complexity of the Naor-Reingold Pseudo-random Function

Authors:
William D. Banks;Frances Griffin;Daniel Lieman;Igor Shparlinski
Affiliations:
-;-;-;-
Venue:
ICISC '99 Proceedings of the Second International Conference on Information Security and Cryptology
Year:
1999

Citing 0
Cited 3

On the Linear Complexity of the Naor–Reingold Pseudo-random Function from Elliptic Curves

Designs, Codes and Cryptography
On the Uniformity of Distribution of the Naor-Reingold Pseudo-Random Function

Finite Fields and Their Applications
On the Distribution of the Diffie-Hellman Pairs

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract