Pseudorandomness

Pseudorandomness is a formal property of a deterministic process or sequence that belongs to the class of algorithmically generated objects (genus) but is computationally indistinguishable from true randomness to any efficient observer, thereby differentiating it from both truly random and statistically non-uniform sequences (differentia).

245

Publications

13.5K

Citations

358

Authors

220

Institutions

Publications per year

2017–2026

26

Authors

358

  1. HN
    Harald Niederreiter

    Austrian Academy of Sciences, Austria

    25 publications · 1.5K citations

    18

    h-index

  2. CM
    Christian Mauduit

    Centre National de la Recherche Scientifique, France

    16 publications · 977 citations

    14

    h-index

  3. AS
    Andràs Sárközy

    Eötvös Loránd University, Hungary

    18 publications · 946 citations

    13

    h-index

  4. JE
    Jürgen Eichenauer‐Herrmann

    Darmstadt University of Applied Sciences, Germany

    11 publications · 172 citations

    10

    h-index

  5. AW
    Arne Winterhof

    Austrian Academy of Sciences, Austria

    9 publications · 151 citations

    9

    h-index

1–5 of 358

Venues

  1. Acta Arithmetica

    7 publications · 519 citations

    7

    h-index

  2. IEEE Transactions on Information Theory

    7 publications · 443 citations

    7

    h-index

  3. Periodica Mathematica Hungarica

    7 publications · 189 citations

    7

    h-index

  4. Mathematics of Computation

    MCOM · 6 publications · 81 citations

    6

    h-index

  5. Finite Fields and Their Applications

    6 publications · 147 citations

    6

    h-index

1–5