Sciweavers

722 search results - page 7 / 145
» Efficient Generation of Prime Numbers
Sort
View
IJCAI
2001
13 years 8 months ago
Efficient Consequence Finding
We present an extensive experimental study of consequence-finding algorithms based on kernel resolution, using both a trie-based and a novel ZBDD-based implementation, which uses ...
Laurent Simon, Alvaro del Val
FSE
2008
Springer
101views Cryptology» more  FSE 2008»
13 years 9 months ago
Post-Processing Functions for a Biased Physical Random Number Generator
Abstract. A corrector is used to reduce or eliminate statistical weakness of a physical random number generator. A description of linear corrector generalizing post-processing desc...
Patrick Lacharme
ACSAC
2003
IEEE
14 years 24 days ago
Practical Random Number Generation in Software
There is a large gap between the theory and practice for random number generation. For example, on most operating systems, using /dev/random to generate a 256-bit AES key is highl...
John Viega
DDECS
2008
IEEE
227views Hardware» more  DDECS 2008»
13 years 9 months ago
Cryptographic System on a Chip based on Actel ARM7 Soft-Core with Embedded True Random Number Generator
The paper introduces a cryptographic System on a Chip (SoC) implementation based on recent Actel nonvolatile FPGA Fusion chip with embedded ARM7 soft-core processor. The SoC is bui...
Milos Drutarovsky, Michal Varchola
VLDB
2007
ACM
109views Database» more  VLDB 2007»
14 years 7 months ago
FluxCapacitor: Efficient Time-Travel Text Search
An increasing number of temporally versioned text collections is available today with Web archives being a prime example. Search on such collections, however, is often not satisfa...
Klaus Berberich, Srikanta J. Bedathur, Thomas Neum...