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

Frances Griffin, Igor E. Shparlinski (1999)

Details and statistics

DOI: 10.1007/978-3-540-47942-0_25

access: closed

type: Conference or Workshop Paper

metadata version: 2020-10-25

a service of  Schloss Dagstuhl - Leibniz Center for Informatics