I know about algorithms like Sieve of Eratosthenes and Sieve of Atkin for generating prime numbers.I would like to know what is the most efficient known algorithm to generate the sequence of $k$ distinct prime numbers all of which are larger than a given number $n$?
What is the most efficient algorithm to generate a sequence of prime numbers?
ds.algorithms;cr.crypto security;nt.number theory