Pseudorandom Generators

Pseudorandom Generators is a cryptographic construct that, as a deterministic algorithm, expands a short random seed into a longer sequence indistinguishable from true randomness by any efficient adversary.

1.2K

Publications

71.9K

Citations

2.3K

Authors

891

Institutions

Publications per year

2017–2026

260

Variants

Prg

Authors

2.3K

  1. HN
    Harald Niederreiter

    Austrian Academy of Sciences, Austria

    29 publications · 3.9K citations

    20

    h-index

  2. LT
    Luca Trevisan

    University of California, Berkeley, United States

    14 publications · 1.4K citations

    14

    h-index

  3. JE
    Jürgen Eichenauer‐Herrmann

    Darmstadt University of Applied Sciences, Germany

    18 publications · 392 citations

    13

    h-index

  4. SV
    Salil Vadhan

    Harvard University Press, United States

    13 publications · 1K citations

    13

    h-index

  5. IE
    Igor E. Shparlinski

    Macquarie University, Australia

    12 publications · 437 citations

    12

    h-index

1–5 of 2.3K

Venues

  1. IEEE Transactions on Information Theory

    21 publications · 1.3K citations

    19

    h-index

  2. Mathematics of Computation

    MCOM · 33 publications · 997 citations

    17

    h-index

  3. Journal of the ACM

    JACM · 17 publications · 1.8K citations

    17

    h-index

  4. SIAM Journal on Computing

    16 publications · 5.9K citations

    15

    h-index

  5. Nonlinear Dynamics

    17 publications · 1.2K citations

    15

    h-index

1–5