Abstract
Randomness is a valuable resource in computation. Randomness is used to run various Monte Carlo simulations of complex systems such as the stock market or weather prediction systems. Various randomized algorithms have been discovered that often vastly outperform known deterministic counterparts (see [MR10] for examples). Cryptography is another area that crucially relies on access to random bits, and it is known that various basic cryptographic primitives fail to be secure if the quality of the randomness used is poor [DOPS04]. However natural sources of randomness are typically defective. This leads to the following basic question: \Can we efficiently produce truly random bits given access to defective sources of randomness?"
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
