15 search results - page 1 / 3 » The Pseudosquares Prime Sieve |
ANTS
2006
Springer
13 years 8 months ago
2006
Springer
We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/((p)(log n)2 ); here (x) is the pri...
ASIACRYPT
2003
Springer
13 years 10 months ago
2003
Springer
We present an algorithm that finds polynomials with many roots modulo many primes by rotating candidate Number Field Sieve polynomials using the Chinese Remainder Theorem. We also...
ISPDC
2005
IEEE
13 years 10 months ago
2005
IEEE
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...
ANTS
2006
Springer
13 years 8 months ago
2006
Springer
This paper offers numerical evidence for a conjecture that primality proving may be done in (log N)3+o(1) operations by examining the growth rate of quantities known as pseudosquar...
MOC
2000
13 years 4 months ago
2000
Seven widely spaced regions of integers with 4,3(x) < 4,1(x) have been discovered using conventional prime sieves. Assuming the generalized Riemann hypothesis, we modify a resul...