Generating quasi-random sequences from semi-random sources
- 31 August 1986
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 33 (1), 75-87
- https://doi.org/10.1016/0022-0000(86)90044-9
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Generating Quasi-Random Sequences From Slightly-Random SourcesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Independent unbiased coin flips from a correlated biased source—A finite state markov chainCombinatorica, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Optimization by Simulated AnnealingScience, 1983
- On the generation of cryptographically strong pseudorandom sequencesACM Transactions on Computer Systems, 1983
- On the generation of cryptographically strong pseudo-random sequencesLecture Notes in Computer Science, 1981
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- The Wire-Tap ChannelBell System Technical Journal, 1975
- Class of constructive asymptotically good algebraic codesIEEE Transactions on Information Theory, 1972