Linear complexity of the Naor-Reingold pseudo-random function (Q294859)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear complexity of the Naor-Reingold pseudo-random function |
scientific article; zbMATH DE number 6594147
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear complexity of the Naor-Reingold pseudo-random function |
scientific article; zbMATH DE number 6594147 |
Statements
Linear complexity of the Naor-Reingold pseudo-random function (English)
0 references
16 June 2016
0 references
Naor-Reingold pseudo-random function
0 references
linear complexity
0 references
cryptography
0 references
0 references
0.9354388117790222
0 references
0.8968799710273743
0 references
0.8809657096862793
0 references
