Sciweavers

722 search results - page 8 / 73
» Efficient Generation of Prime Numbers
Sort
View
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...
192 views 123 votes 16 years 26 days ago  ICCAD 2001»
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
246 views 121 votes 15 years 8 months ago  APPT 2009»
We present the algorithm to multiply univariate polynomials with integer coefficients efficiently using the Number Theoretic transform (NTT) on Graphics Processing Units (GPU). The...
138 views 137 votes 15 years 7 months ago  FCCM 2006»
This paper presents a technique for efficiently generating random numbers from a given probability distribution. This is achieved by using a generic hardware architecture, which t...
101 views 116 votes 15 years 9 months ago  GECCO 2004»
In this paper, a novel multi-objective orthogonal simulated annealing algorithm MOOSA using a generalized Pareto-based scale-independent fitness function and multi-objective intell...
138 views 109 votes 15 years 4 months ago  CORR 2008»
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...