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

William D. Banks et al. (1999)

> Home

Details and statistics

DOI: 10.1007/10719994_5

access: closed

type: Conference or Workshop Paper

metadata version: 2020-10-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icisc/BanksGLS99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icisc/BanksGLS99
William D. Banks, Frances Griffin, Daniel Lieman, Igor E. Shparlinski:
Non-linear Complexity of the Naor-Reingold Pseudo-random Function. ICISC 1999: 53-59

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.