65 search results - page 12 / 13 » On the Randomness of Bits Generated by Sufficiently Smooth F... |
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
SYNTHESE
2010
13 years 2 months ago
2010
In this paper I outline my conception of the epistemology of science, by reference to my published papers, showing how the ideas presented there fit together. In particular I disc...
FC
2007
Springer
14 years 1 months ago
2007
Springer
Responding to the PIN cracking attacks from Berkman and Ostrovsky (FC 2007), we outline a simple solution called salted-PIN. A randomly generated salt value of adequate length (e.g...
SIROCCO
2008
13 years 8 months ago
2008
Abstract. Consider a system composed of n sensors operating in synchronous rounds. In each round an input vector of sensor readings x is produced, where the i-th entry of x is a bi...
CSE
2009
IEEE
14 years 2 months ago
2009
IEEE
Conventional cryptography uses encryption key, which are long bit strings and are very hard to memorize such a long random numbers. Also it can be easily attacked by using the brut...