Perfect Local Randomness in Pseudo-random Sequences
- 6 July 2001
- conference paper
- Published by Springer Nature
- p. 100-112
- https://doi.org/10.1007/0-387-34805-0_11
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On the power of two-point based samplingJournal of Complexity, 1989
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- Primality and CryptographyPublished by Springer Nature ,1986
- The bit extraction problem or t-resilient functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- On a Set of Almost Deterministic $k$-Independent Random VariablesThe Annals of Probability, 1974
- On a Sequence of Almost Deterministic Pairwise Independent Random VariablesProceedings of the American Mathematical Society, 1971
- Pairwise Statistical IndependenceThe Annals of Mathematical Statistics, 1965