Naor–Reingold pseudorandom function
id:
naor-reingold-pseudorandom-function-264-2289227
title:
Naor–Reingold pseudorandom function
text:
In 1997, Moni Naor and Omer Reingold described efficient constructions for various cryptographic primitives in private key as well as public-key cryptography. Their result is the construction of an efficient pseudorandom function. Let p and l be prime numbers with l |p−1. Select an element g ∈ F p ∗ of multiplicative order l. Then for each (n+1)-dimensional vector a = (a0,a1, ..., an)∈ ( F l ) n + 1 they define the function where x = x1 ... xn is the bit representation of integer x, 0 ≤ x ≤ 2n−1
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Naor%E2%80%93Reingold_pseudorandom_function
date created:
date modified:
2024-01-25T18:53:00Z
main entity:
{"identifier":"Q6964725","url":"https://www.wikidata.org/entity/Q6964725"}
image:
fields total:
13
integrity:
13