Efficient Parallel Pseudo-Random Number Generation

This publication has 16 references indexed in Scilit:

• A parallel algorithm for the maximal path problem
  Published by Association for Computing Machinery (ACM) ,1985
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
  SIAM Journal on Computing, 1984
• A fast parallel algorithm for the maximal independent set problem
  Published by Association for Computing Machinery (ACM) ,1984
• RSA/Rabin Bits are 1/2 + 1 / Poly (Log N) Secure
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1984
• Fast Parallel Computation of Polynomials Using Few Processors
  SIAM Journal on Computing, 1983
• Trapdoor pseudo-random number generators, with applications to protocol design
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• On the generation of cryptographically strong pseudorandom sequences
  ACM Transactions on Computer Systems, 1983
• Why and how to establish a private code on a public network
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• Schnelle Multiplikation großer Zahlen
  Computing, 1971
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
  The Annals of Mathematical Statistics, 1952