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

Igor E. Shparlinski, Joseph H. Silverman (2001)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2019-06-17

- no documents available
- export record
  dblp key:
  - journals/dcc/ShparlinskiS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcc/ShparlinskiS01
Igor E. Shparlinski, Joseph H. Silverman:
On the Linear Complexity of the Naor-Reingold Pseudo-random Function from Elliptic Curves. Des. Codes Cryptogr. 24(3): 279-289 (2001)

a service of

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.