Fast algorithm for generating consecutive primes larger than N

155 Views Asked by At

I'm looking for a fast algorithm to generate primes larger than a random 4096 bit number $N$. I know about the Sieve of Atkin, but AFAIK it can only be used to find all primes up to a certain limit. At the moment I am using a combination of sieving out composites of small primes plus Miller-Rabin-Test. Probabilistic methods are OK - I just need to generate good candidates quickly...