Naor–Reingold pseudorandom function
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 ∈ of multiplicative order l. Then for each (n+1)-dimensional vector a = (a0,a1, ..., an)∈ they define the function where x = x1 … xn is the bit representation of integer x, 0 ≤ x ≤ 2n−1, with some extra leading zeros if necessary.
Wikipage disambiguates
Link from a Wikipage to another Wikipage
primaryTopic
Naor–Reingold pseudorandom function
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 ∈ of multiplicative order l. Then for each (n+1)-dimensional vector a = (a0,a1, ..., an)∈ they define the function where x = x1 … xn is the bit representation of integer x, 0 ≤ x ≤ 2n−1, with some extra leading zeros if necessary.
has abstract
In 1997, Moni Naor and Omer Re ...... ra leading zeros if necessary.
@en
Псевдослучайная функция Наора ...... многих криптографических схем.
@ru
Wikipage page ID
30,578,523
page length (characters) of wiki page
Wikipage revision ID
993,403,629
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
In 1997, Moni Naor and Omer Re ...... ra leading zeros if necessary.
@en
Псевдослучайная функция Наора ...... многих криптографических схем.
@ru
label
Naor–Reingold pseudorandom function
@en
Псевдослучайная функция Наора — Рейнгольда
@ru