The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
How to recycle random bits
Abstract
It is shown that modified versions of the linear congruential generator and the shift register generator are provably good for amplifying the correctness of a probabilistic algorithm. More precisely, if r random bits are needed for a BPP algorithm to be correct with probability at least 2/3, then O(r+k/sup 2/) bits are needed to improve this probability to 1-2/sup -k/. A different pseudorandom generator that is optimal, up to a constant factor, in this regard is also presented. It uses only O(r+k) bits to improve the probability to 1-2/sup -k/. This generator is based on random walks on expanders. The results do not depend on any unproven assumptions. It is shown that the modified versions of the shift register and linear congruential generators can be used to sample from distributions using, in the limit, the information-theoretic lower bound on random bits.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Blum, M., & Micali, S. (1984) · SIAM Journal on Computing · doi:10.1137/0213053 · Cited by 1,322
Theory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,008
Random generation of combinatorial structures from a uniform distribution
Jerrum, M. R., Valiant, L. G., & Vazirani, V. V. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90174-x · Cited by 985
Theory and application of trapdoor functions
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.45 · Cited by 968
Probabilistic algorithm for testing primality
Rabin, M. O. (1980) · Journal of Number Theory · doi:10.1016/0022-314x(80)90084-0 · Cited by 863
Pseudo-random generation from one-way functions
Impagliazzo, R., Levin, L. A., & Luby, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73009 · Cited by 724
Self-citationTen Lectures on the Probabilistic Method: Second Edition
Spencer, J. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970074 · Cited by 440
Dispersers, deterministic amplification, and weak random sources
Cohen, A., & Wigderson, A. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63449 · Cited by 182
Cited by
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2009) · Journal of the ACM · doi:10.1145/1568318.1568324 · Cited by 2,315
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2005) · Proceedings of the thirty-seventh annual ACM symposium on Theory of computing · doi:10.1145/1060590.1060603 · Cited by 2,313
A Pseudorandom Generator from any One-way Function
HÅstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539793244708 · Cited by 1,653
Self-citationExperimental quantum cryptography
Bennett, C. H., Bessette, F., Brassard, G., Salvail, L., & Smolin, J. (1992) · Journal of Cryptology · doi:10.1007/bf00191318 · Cited by 1,614
Generalized privacy amplification
Bennett, C. H., Brassard, G., Crepeau, C., & Maurer, U. M. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.476316 · Cited by 1,417
Proof verification and the hardness of approximation problems
Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1998) · Journal of the ACM · doi:10.1145/278298.278306 · Cited by 1,413
Cramer, R., & Shoup, V. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702403773 · Cited by 978
Experimental Quantum Cryptography
Bennett, C. H., Bessette, F., Brassard, G., Salvail, L., & Smolin, J. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46877-3_23 · Cited by 959
Proof verification and hardness of approximation problems
Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1992) · Proceedings., 33rd Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267823 · Cited by 741
A Framework for Efficient and Composable Oblivious Transfer
Peikert, C., Vaikuntanathan, V., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_31 · Cited by 678
Entropic uncertainty relations and their applications
Coles, P. J., Berta, M., Tomamichel, M., & Wehner, S. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015002 · Cited by 658
Nisan, N., & Zuckerman, D. (1996) · Journal of Computer and System Sciences · doi:10.1006/jcss.1996.0004 · Cited by 634
Self-citationSimple Constructions of Almost k‐wise Independent Random Variables
Alon, N., Goldreich, O., Håstad, J., & Peralta, R. (1992) · Random Structures & Algorithms · doi:10.1002/rsa.3240030308 · Cited by 556
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
Impagliazzo, R., & Wigderson, A. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258590 · Cited by 534
Self-citationRandom walks in peer-to-peer networks
Gkantsidis, C., Mihail, M., & Saberi, A. (2004) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354487 · Cited by 525
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
Bellare, M., Goldreich, O., & Sudan, M. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539796302531 · Cited by 453
Cryptographic Extraction and Key Derivation: The HKDF Scheme
Krawczyk, H. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_34 · Cited by 408
Linear degree extractors and the inapproximability of max clique and chromatic number
Zuckerman, D. (2006) · Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/1132516.1132612 · Cited by 398
Self-citationNumber-theoretic constructions of efficient pseudo-random functions
Naor, M., & Reingold, O. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646134 · Cited by 353
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Quantum Information Processing with Finite Resources
Tomamichel, M. (2016) · SpringerBriefs in Mathematical Physics · doi:10.1007/978-3-319-21891-5 · Cited by 329
Signature schemes based on the strong RSA assumption
Cramer, R., & Shoup, V. (2000) · ACM Transactions on Information and System Security · doi:10.1145/357830.357847 · Cited by 325
Leftover Hashing Against Quantum Side Information
Tomamichel, M., Schaffner, C., Smith, A., & Renner, R. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2158473 · Cited by 303
A personal view of average-case complexity
Impagliazzo, R. (2002) · Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference · doi:10.1109/sct.1995.514853 · Cited by 298
Self-citationUnbalanced expanders and randomness extractors from Parvaresh--Vardy codes
Guruswami, V., Umans, C., & Vadhan, S. (2009) · Journal of the ACM · doi:10.1145/1538902.1538904 · Cited by 281
Probabilistic checking of proofs; a new characterization of NP
Arora, S., & Safra, S. (1992) · Proceedings., 33rd Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267824 · Cited by 275
Free bits, PCPs and non-approximability-towards tight results
Bellare, M., Goldreich, O., & Sudan, M. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492573 · Cited by 265
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Goldreich, O. (1999) · Algorithms and Combinatorics · doi:10.1007/978-3-662-12521-2 · Cited by 265
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
Alon, N., Bruck, J., Naor, J., Naor, M., & Roth, R. M. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119713 · Cited by 257
The Learning with Errors Problem (Invited Survey)
Regev, O. (2010) · 2010 IEEE 25th Annual Conference on Computational Complexity · doi:10.1109/ccc.2010.26 · Cited by 255
Trevisan's Extractor in the Presence of Quantum Side Information
De, A., Portmann, C., Vidick, T., & Renner, R. (2012) · SIAM Journal on Computing · doi:10.1137/100813683 · Cited by 161
Metadata
- Authors
- Impagliazzo, R., & Zuckerman, D.
- Venue
- 30th Annual Symposium on Foundations of Computer Science
- Publisher
- IEEE
- Published
- 1989
- Pages
- 248-253
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2110824700
- Cited by
- 387
- References
- 14
- FWCI
- 7.14
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.