Results 1  10
of
6,853
The pseudosquares prime sieve
 Proceedings of the 7th International Symposium on Algorithmic Number Theory (ANTSVII
, 2006
"... Abstract. We present the pseudosquares prime sieve, ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract. We present the pseudosquares prime sieve,
Parallel Prime Sieve: Finding Prime Numbers
 Institute of Information & Mathematical Sciences Massey University at
"... Before the 19th of century, there was not much use of prime numbers. However in the 19th of century, the people used prime numbers to secure the messages and data during times of war. This research paper is to study how we find a large prime number using some prime sieve techniques using parallel co ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Before the 19th of century, there was not much use of prime numbers. However in the 19th of century, the people used prime numbers to secure the messages and data during times of war. This research paper is to study how we find a large prime number using some prime sieve techniques using parallel
PRIME SIEVES USING BINARY QUADRATIC FORMS
, 2003
"... We introduce an algorithm that computes the prime numbers up to N using O(N/log log N) additions and N 1/2+o(1) bits of memory. The algorithm enumerates representations of integers by certain binary quadratic forms. We present implementation results for this algorithm and one of the best previous ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
We introduce an algorithm that computes the prime numbers up to N using O(N/log log N) additions and N 1/2+o(1) bits of memory. The algorithm enumerates representations of integers by certain binary quadratic forms. We present implementation results for this algorithm and one of the best previous
A Distributed Prime Sieving Algorithm based on Scheduling by Multiple Edge Reversal
 In: 4th International Symposium on Parallel and Distributed Computing, 2005, Lille. Proceedings of the 4th International Symposium on Parallel and Distributed Computing. Los Alamitos
, 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 — Scheduling by Multiple Edge Reversal — multigraph dynamics. Given a multigraph M of arbitrary topology, having N nodes, the SMERdr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
driven system is defined by the number of directed edges (arcs) between any two nodes of M, and by the global period length of all “arc reversals ” in M. In the domain of prime numbers generation, such a graph method shows quite elegant, and it also yields a totally new kind of distributed prime sieving
Author manuscript, published in "4th International Symposium on Parallel and Distributed Computing, France (2005)" A Distributed Prime Sieving Algorithm based on Scheduling by Multiple Edge Reversal
, 2010
"... Abstract — In this article, we propose a fully distributed algorithm for finding all primes in a given interval [2..n] (or (L, R), more generally), based on the SMER — Scheduling by Multiple Edge Reversal — multigraph dynamics. Given a multigraph M of arbitrary topology, having N nodes, an SMERdriv ..."
Abstract
 Add to MetaCart
driven system is defined by the number of directed edges (arcs) between any two nodes of M, and by the global period length of all “arc reversals ” in M. In the domain of prime numbers generation, such a graph method shows quite elegant, and it also yields a totally new kind of distributed prime sieving
Sieve Methods
"... called undeniable signature schemes require prime numbers of the form 2p 1 such that p is also prime. Sieve methods can yield valuable clues about these distributions and hence allow us to bound the running times of these algorithms. In this treatise we survey the major sieve methods and their i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
called undeniable signature schemes require prime numbers of the form 2p 1 such that p is also prime. Sieve methods can yield valuable clues about these distributions and hence allow us to bound the running times of these algorithms. In this treatise we survey the major sieve methods
Sieve with Two Large Primes
"... This paper deals with variations of the Quadratic Sieve integer factoring algorithm. We describe what we believe is the rst implementation of the Hypercube Multiple Polynomial Quadratic Sieve with two large primes, We have used this program to factor many integers with up to 116 digits. Our program ..."
Abstract
 Add to MetaCart
This paper deals with variations of the Quadratic Sieve integer factoring algorithm. We describe what we believe is the rst implementation of the Hypercube Multiple Polynomial Quadratic Sieve with two large primes, We have used this program to factor many integers with up to 116 digits. Our
Asymptotic sieve for primes
, 1998
"... For a long time it was believed that sieve methods might be incapable of achieving the goal for which they had been created, the detection of prime numbers. Indeed, it was shown [S], [B] to be inevitable that, in the sieve’s original framework, no such result was possible although one could come tan ..."
Abstract
 Add to MetaCart
For a long time it was believed that sieve methods might be incapable of achieving the goal for which they had been created, the detection of prime numbers. Indeed, it was shown [S], [B] to be inevitable that, in the sieve’s original framework, no such result was possible although one could come
Results 1  10
of
6,853