About: Naor–Reingold pseudorandom function

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Naor–Reingold pseudorandom function Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/c/9S92YKg9oU

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.

Attributes	Values
rdfs:label	Naor–Reingold pseudorandom function (en) Псевдослучайная функция Наора — Рейнгольда (ru)
rdfs:comment	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. (en) Псевдослучайная функция Наора — Рейнгольда — , введённая в 1997 году и для построения различных криптографических примитивов в симметричном шифровании и криптографии с открытым ключом. Отличительными особенностями данной псевдослучайной функции являются низкая вычислительная сложность и высокая криптографическая стойкость. Данные свойства вместе с тем фактом, что распределение значений данной функции близко к равномерному, позволяют использовать ее в качестве основы для многих криптографических схем. (ru)
dcterms:subject	Cryptography Pseudorandom number generators
Wikipage page ID	30578523 (xsd:integer)
Wikipage revision ID	993403629 (xsd:integer)
Link from a Wikipage to another Wikipage	Moni Naor Multiplicative order Binary numeral system Decisional Diffie–Hellman assumption Inversive congruential generator Symmetric-key algorithm Pseudorandom function family Cryptography Cryptography Generalized inversive congruential pseudorandom numbers Elliptic curve Modular exponentiation Coordinate vector Cryptographic primitive Computational Diffie–Hellman assumption Public-key cryptography Subgroup Authentication Finite field PP (complexity) Pseudorandom number generator Recurrence relation Group (mathematics) Prime number Pseudorandom number generators Diffie–Hellman problem Digital signatures Omer Reingold Sequence Uniform distribution (discrete) Negligible function Journal of the Association for Computing Machinery
sameAs	Naor–Reingold pseudorandom function Naor–Reingold pseudorandom function Naor–Reingold pseudorandom function
dbp:wikiPageUsesTemplate	dbt:Citation dbt:Reflist
has abstract	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. (en) Псевдослучайная функция Наора — Рейнгольда — , введённая в 1997 году и для построения различных криптографических примитивов в симметричном шифровании и криптографии с открытым ключом. Отличительными особенностями данной псевдослучайной функции являются низкая вычислительная сложность и высокая криптографическая стойкость. Данные свойства вместе с тем фактом, что распределение значений данной функции близко к равномерному, позволяют использовать ее в качестве основы для многих криптографических схем. (ru)
prov:wasDerivedFrom	wikipedia-en:Naor–Reingold_pseudorandom_function?oldid=993403629&ns=0
page length (characters) of wiki page	10947 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Naor–Reingold_pseudorandom_function
is Link from a Wikipage to another Wikipage of	Decision Linear assumption List of random number generators Naor-Reingold Pseudorandom Function Naor-Reingold pseudorandom function
is Wikipage redirect of	Naor-Reingold Pseudorandom Function Naor-Reingold pseudorandom function
is foaf:primaryTopic of	wikipedia-en:Naor–Reingold_pseudorandom_function

Faceted Search & Find service v1.17_git147 as of Sep 06 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3332 as of Dec 5 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 76 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software