Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

109

Voted

ANTS
2006
Springer

136views Algorithms» more ANTS 2006»

On the Randomness of Bits Generated by Sufficiently Smooth Functions

15 years 6 months ago

On the Randomness of Bits Generated by Sufficiently Smooth Functions

Download perso.ens-lyon.fr

Damien Stehlé

Real-time Traffic

Algorithms | ANTS 2006 |

claim paper

Related Content

» An Efficient Discrete Log Pseudo Random Generator

» Smooth ideals in hyperelliptic function fields

» Recent Developments in Explicit Constructions of Extractors

» Towards True Random Number Generation in Mobile Environments

» Fast Bit Gather Bit Scatter and Bit Permutation Instructions for Commodity Microprocessors

» Physical unclonable function and true random number generator a compact and scalable imple...

» Practical Random Number Generation in Software

» Studying XCSBOA learning in Boolean functions structure encoding and random Boolean functi...

» Altering a PseudoRandom Bit Sequence for ScanBased BIST

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	ANTS
Authors	Damien Stehlé

Comments (0)