[PDF][PDF] Sieving for large Cunningham chains of length 3 of the first kind

G Farkas, E Vatai - Annales Univ. Sci. Budapest, Sect. Comp, 2013 - researchgate.net
In this paper we study the details of sieving for Cunningham chains of the first kind of length
3. To find such prime triplets larger than the ones already known, we have to investigate the …

Distributed prime sieve in heterogeneous computer clusters

CM Costa, AM Sampaio, JG Barbosa - … , Portugal, June 30–July 3, 2014 …, 2014 - Springer
Prime numbers play a pivotal role in current encryption algorithms and given the rise of
cloud computing, the need for larger primes has never been so high. This increase in …

[PDF][PDF] Sieving for Large Twin Primes and Cunningham chains of length 2 of the second kind

T Csajbók, G Farkas, J Kasza - Annales Univ. Sci. Budapest, Sect …, 2012 - ac.inf.elte.hu
In this paper we study the details of a triple sieving method for Cunningham chains of length
2 of the second kind and twin primes. The theoretical background is described, and also …

JÁRAI'S PRIME HUNTING METHODS RELOADED (THE LARGEST KNOWN CUNNINGHAM CHAIN OF LENGTH 2 OF THE 2nd KIND).

G Farkas, G Gévay, P Magyar… - … de Rolando Eotvos …, 2020 - search.ebscohost.com
Antal Járai established three research groups that dealt with computational number theory.
Due to his brilliant ideas these teams were very successful. Moreover, he implemented the …

[PDF][PDF] JARAI'S PRIME HUNTING METHODS RELOADED (THE LARGEST KNOWN CUNNINGHAM CHAIN

G Farkas, G Gévay, P Magyar, B Szekeres - researchgate.net
Antal Járai established three research groups that dealt with computational number theory.
Due to his brilliant ideas these teams were very successful. Moreover, he implemented the …

[引用][C] Sieving in primality testing and factorization

V Emil - 2014

[引用][C] Sieving in primality testing and factorization

E Vatai - 2015 - Eötvös Loránd University, Hungary