Sciweavers

722 search results - page 7 / 73
» Efficient Generation of Prime Numbers
Sort
View
110 views 119 votes 15 years 5 months ago  IJCAI 2001»
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 ...
101 views 124 votes 15 years 5 months ago  FSE 2008»
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...
114 views 138 votes 15 years 9 months ago  ACSAC 2003»
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...
227 views 151 votes 15 years 5 months ago  DDECS 2008»
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...
109 views 183 votes 16 years 4 months ago  VLDB 2007»
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...
149 views 209 votes 15 years 1 months ago  ERSA 2009»
Many scientific and engineering applications, which are increasingly being ported from software to reconfigurable platforms, require Gaussian-distributed random numbers. Thus, the...
139 views 148 votes 15 years 1 months ago  FPL 2010»
A Multivariate Gaussian random number generator (MVGRNG) is an essential block for many hardware designs, including Monte Carlo simulations. These simulations are usually used in a...
123 views 124 votes 15 years 9 months ago  ISLPED 2004»
Increasing demand for larger high-performance applications requires developing more complex systems with hundreds of processing cores on a single chip. To allow dynamic voltage sc...
91 views 102 votes 15 years 8 months ago  CRYPTO 2000»
Under the assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number, we construct a new and improved pse...
133 views 123 votes 15 years 9 months ago  INDOCRYPT 2005»
Let p be a prime and let a and c be integers modulo p. The quadratic congruential generator (QCG) is a sequence (vn) of pseudorandom numbers defined by the relation vn+1 ≡ av2 n...