Sciweavers

722 search results - page 4 / 73
» Efficient Generation of Prime Numbers
Sort
View
117 views 138 votes 15 years 1 months ago  CC 2010»
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
118 views 136 votes 15 years 8 months ago  PKDD 1999»
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
183 views 130 votes 15 years 7 months ago  ASIACRYPT 2006»
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
132 views 122 votes 15 years 3 months ago  PC 1998»
Linear congruential generators (LCGs) remain the most popular method of pseudorandom number generation on digital computers. Ease of implementation has favored implementing LCGs wi...
93 views 140 votes 15 years 9 months ago  PKC 2005»
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usabl...
164 views 143 votes 15 years 10 months ago  ICPP 2008»
Numerical simulations in computational physics, biology, and finance, often require the use of high quality and efficient parallel random number generators. We design and optimi...
98 views 130 votes 15 years 8 months ago  INDOCRYPT 2001»
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...
103 views 118 votes 15 years 6 months ago  ANTS 2008»
Abstract. We further analyze the solutions to the Diophantine equations from which prime-order elliptic curves of embedding degrees k = 3, 4 or 6 (MNT curves) may be obtained. We g...
125 views 162 votes 15 years 9 months ago  ISPDC 2005»
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
150 views 148 votes 15 years 5 months ago  ERSA 2006»
Reconfigurable computing offers an attractive solution to accelerating infrared scene simulations. In infrared scene simulations, the modeling of a number of atmospheric and optic...