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

Authors

480

  1. AS
    Andràs Sárközy

    Eötvös Loránd University, Hungary

    12 publications · 541 citations

    11

    h-index

  2. CM
    Christian Mauduit

    Centre National de la Recherche Scientifique, France

    8 publications · 459 citations

    8

    h-index

  3. HN
    Harald Niederreiter

    Austrian Academy of Sciences, Austria

    6 publications · 3.2K citations

    6

    h-index

  4. SV
    Salil Vadhan

    Harvard University Press, United States

    5 publications · 172 citations

    5

    h-index

  5. LM
    László Mérai

    Eötvös Loránd University, Hungary

    4 publications · 52 citations

    4

    h-index

1–5 of 480

Venues

  1. ACM SIGACT News

    14 publications · 462 citations

    11

    h-index

  2. IACR Cryptology ePrint Archive

    Repository · 10 publications · 310 citations

    10

    h-index

  3. Journal of Cryptology

    7 publications · 849 citations

    7

    h-index

  4. Periodica Mathematica Hungarica

    7 publications · 229 citations

    7

    h-index

  5. Finite Fields and Their Applications

    6 publications · 259 citations

    6

    h-index

1–5