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
Parents
1.2K
Makoto Matsumoto, Takuji Nishimura · ACM Transactions on Modeling and Computer Simulation · 1998 · 5.7K citations
A Pseudorandom Generator from any One-way Function
Johan Håstad, Russell Impagliazzo, Leonid A. Levin et al. · SIAM Journal on Computing · 1999 · 1.7K citations
Efficient stochastic generation of special quasirandom structures
Axel van de Walle, Pratyush Tiwary, Maarten de Jong et al. · Calphad · 2013 · 1.6K citations
1–5 of 1.2K
2.3K
20
h-index
14
h-index
Darmstadt University of Applied Sciences, Germany
18 publications · 392 citations
13
h-index
13
h-index
12
h-index
1–5 of 2.3K
891
University of California, Berkeley
Berkeley, United States
23 h-index
39 publications
10.9K citations
Massachusetts Institute of Technology
Cambridge, United States
20 h-index
41 publications
3.7K citations

Centre National de la Recherche Scientifique
Paris, France
20 h-index
54 publications
1.9K citations
Austrian Academy of Sciences
Vienna, Austria
19 h-index
31 publications
3.8K citations

Weizmann Institute of Science
Rehovot, Israel
16 h-index
21 publications
1.3K citations
Technion – Israel Institute of Technology
Haifa, Israel
16 h-index
29 publications
3.7K citations
Stanford University
Stanford, United States
14 h-index
21 publications
874 citations

Huazhong University of Science and Technology
Wuhan, China
13 h-index
31 publications
2.6K citations
1–8 of 891
21 publications · 1.3K citations
19
h-index
MCOM · 33 publications · 997 citations
17
h-index
JACM · 17 publications · 1.8K citations
17
h-index
16 publications · 5.9K citations
15
h-index
17 publications · 1.2K citations
15
h-index
1–5