Sciweavers

722 search results - page 9 / 73
» Efficient Generation of Prime Numbers
Sort
View
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 138 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, ...
151 views 124 votes 16 years 3 months ago  DCC 2007»
Let p be a prime and let E(IFp) be an elliptic curve defined over the finite field IFp of p elements. For a given point G E(IFp) the linear congruential genarator on elliptic curv...
180 views 141 votes 15 years 5 months ago  DLT 2003»
We continue our investigation on the relationship between regular languages and syntactic monoid size. In this paper we confirm the conjecture on two generator transformation semi...
122 views 132 votes 15 years 7 months ago  EUROCRYPT 2000»
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
183 views 147 votes 15 years 21 days ago  CMA 2010»
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
125 views 139 votes 15 years 4 months ago  CORR 2008»
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...