Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
26
click to vote
ANTS
2006
Springer
favorite
Email
discuss
report
136
views
Algorithms
»
more
ANTS 2006
»
On the Randomness of Bits Generated by Sufficiently Smooth Functions
14 years 1 months ago
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
more »
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)
Researcher Info
Algorithms Study Group
Computer Vision