247 search results - page 5 / 50 » Extracting All the Randomness from a Weakly Random Source |
44
Voted
FPGA
2004
ACM
13 years 11 months ago
2004
ACM
Field Programmable Gate Arrays (FPGAs) are an increasingly popular choice of platform for the implementation of cryptographic systems. Until recently, designers using FPGAs had le...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
ISMIR
2005
Springer
14 years 1 months ago
2005
Springer
Music information retrieval is characterized by a number of various user information needs. Systems are being developed that allow searchers to find melodies, rhythms, genres, an...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
ECCC
2011
13 years 2 months ago
2011
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...