Pierre L'Ecuyer, René Proulx  Home/Search
Context
Related
| iro.umontreal.ca/~lecuyer/m...nlin89.ps cs.sun.ac.za/~lynette/simul...nlin89.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iro.umontreal.ca/~lecuye...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: So-called "perfect" or "unpredictable" pseudorandom generators have been proposed recently by people from the area of cryptology. Many people got aware of them from an optimistic article in the New York Times (Gleick (1988)). These generators are usually based on nonlinear recurrences modulo some integer m. Under some (yet unproven) complexity assumptions, it has been proven that no polynomial-time statistical test can distinguish a sequence of bits produced by such a generator from a sequence... (Update)
Active bibliography (related documents): More All
0.5: "Pseudo-Random" Number Generation within.. - Bellare, Goldwasser, .. (1997) (Correct)
0.5: A Study Of Random Weyl Trees - Devroye, Goudjil (1998) (Correct)
0.3: Linear Congruential Generators over Elliptic Curves - Hallgren (1994) (Correct)
Similar documents based on text: More All
0.1: Extensible Lattice Sequences For Quasi-Monte Carlo.. - Hickernell, HONG.. (1999) (Correct)
0.1: The Program a2ac - Font Handling on the PostScript Level - Olsak (1995) (Correct)
0.1: A New Contribution To The Flavour-Changing Lepton-Photon Vertex - Palle (Correct)
BibTeX entry: (Update)
@misc{ l'ecuyer-about,
author = "Pierre L'Ecuyer and René Proulx",
title = "About Polynomial-Time "unpredictable" Generators",
url = "citeseer.ist.psu.edu/137827.html" }
Citations (may not include all citations):419 How to Construct Random Functions (context) - Goldreich, Goldwasser et al. - 1986
339 Theory and Applications of Trapdoor Functions (context) - Yao - 1982
173 How to Construct Pseudorandom Permutations From Pseudorandom.. (context) - Luby, Rackoff - 1988
159 A Guide to Simulation (context) - Bratley, Fox et al. - 1987
119 The Art of Computer Programming : Seminumerical Algorithms (context) - Knuth - 1981
109 Digitalized Signature and PublicKey Functions as Intractable.. (context) - Rabin - 1979
103 A Simple Unpredictable Pseudo-Random Number Generator (context) - Blum, Blum et al. - 1986
68 One-Way Functions and Pseudorandom Generators (context) - Levin - 1987
62 RSA and Rabin Functions: Certain Parts are as Hard as the Wh.. (context) - Alexi, Chor et al. - 1988
35 Efficient and Portable Combined Random Number Generators (context) - L'Ecuyer - 1988
23 Efficient and Secure Pseudo-Random Number Generation (context) - Vazirani, Vazirani - 1984
21 Reconstructing Truncated Integer Variables Satisfying Linear.. (context) - Frieze, Hastad et al. - 1988
14 Inferring a Sequence Generated by a Linear Congruence (context) - Plumstead - 1982
12 The Generation of Random Numbers That Are Probably Prime - Beauchemin, Brassard et al. - 1988
9 Inferring Sequences Produced by Pseudo-Random Number Generat.. (context) - Boyar
8 Efficient Parallel Pseudorandom Number Generation (context) - Reif, Tygar - 1988
8 Secret Linear Congruential Generators are not Cryptographica.. (context) - Stern - 1987
8 Probabilistic Algorithms for Primality Testing (context) - Rabin - 1980
7 Implementation of the Atkin-Goldwasser -Kilian Primality Tes.. - Morain - 1988
6 Modern Cryptology: A Tutorial (context) - Brassard - 1988
5 Linear Congruential Generators Do Not Produce Random Sequenc.. (context) - Frieze, Kannan et al. - 1984
4 Trapdoor PseudoRandom Number Generators with Applications to.. (context) - Vazirani, Vazirani - 1983
2 A Tutorial on Uniform Variate Generation (context) - L'Ecuyer - 1989
1 Preliminary version published (context) - Comput - 1984
1 SENTIERS: Un logiciel Modula-2 pour l'arithm'etique sur les .. (context) - Proceedings, Perron et al. - 1988
1 The Quest for True Randomness Finally Appears Successful (context) - Gleick - 1988
1 Super-Efficient (context) - Computing, Micali et al. - 1988
1 Missing Low Order Bits in a Linear Congruential Generator (context) - Boyar
Documents on the same site (http://www.iro.umontreal.ca/~lecuyer/papers.html): More
Lattice Rules for the Simulation of Ruin Problems - Lemieux, L'Ecuyer (Correct)
Lattice Computations for Random Numbers - Couture, L'Ecuyer (1999) (Correct)
Maximally Equidistributed Combined Tausworthe Generators - L'Ecuyer (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC