Pseudorandom Permutations
Pseudorandom Permutations is a cryptographic primitive that belongs to the class of keyed permutations and is defined by its indistinguishability from a randomly chosen permutation in the set of all permutations over a fixed domain, such that no efficient adversary can distinguish it from uniform randomness given oracle access, even when allowed to query both the function and its inverse.
233
Publications
16K
Citations
480
Authors
251
Institutions
Publications per year
2017–2026
47
Variants
Prps
Parents
233
A hard-core predicate for all one-way functions
Oded Goldreich, Leonid A. Levin · 1989 · 1.2K citations
Built-in test for VLSI: Pseudorandom techniques
Integration · 1989 · 866 citations
Engineering, Computer Engineering, Electrical Engineering +12
Phillip Rogaway, Mihir Bellare, John Black et al. · 2001 · 362 citations
1–5 of 233
480
11
h-index
8
h-index
6
h-index
5
h-index
4
h-index
1–5 of 480
251

Eötvös Loránd University
Budapest, Hungary
13 h-index
16 publications
871 citations

Centre National de la Recherche Scientifique
Paris, France
11 h-index
14 publications
801 citations
Institut de Mathématiques de Marseille
Marseille, France
7 h-index
10 publications
533 citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
8 publications
660 citations
University of California, Berkeley
Berkeley, United States
6 h-index
10 publications
814 citations
University of Chicago
Chicago, United States
6 h-index
7 publications
458 citations
Austrian Academy of Sciences
Vienna, Austria
6 h-index
7 publications
3.2K citations
National University of Singapore
Singapore, Singapore
6 h-index
9 publications
386 citations
1–8 of 251
14 publications · 462 citations
11
h-index
Repository · 10 publications · 310 citations
10
h-index
7 publications · 849 citations
7
h-index
7 publications · 229 citations
7
h-index
6 publications · 259 citations
6
h-index
1–5