65 search results - page 1 / 13 » On the Randomness of Bits Generated by Sufficiently Smooth F... |
ANTS
2006
Springer
13 years 8 months ago
2006
Springer
CRYPTO
1998
Springer
13 years 9 months ago
1998
Springer
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
MOC
2002
13 years 4 months ago
2002
Recently, several algorithms have been suggested for solving the discrete logarithm problem in the Jacobians of high-genus hyperelliptic curves over finite fields. Some of them hav...
EATCS
2002
13 years 4 months ago
2002
Extractors are functions which are able to "extract" random bits from arbitrary distributions which "contain" sufficient randomness. Explicit constructions of ...
NORDSEC
2009
Springer
13 years 11 months ago
2009
Springer
In our paper, we analyze possibilities to generate true random data in mobile devices such as mobile phones or pocket computers. We show how to extract arguably true random data w...