Skip to content

On the Linear Complexity of the Naor-Reingold Pseudo-Random Function.

Frances Griffin, Igor E. Shparlinski

VenueCICICS
Year1999
ProceedingsICICS

Browse the full ICICS paper archive.