Classic Linear Sieves Revisited

• Mircea Ghidarcea

  University POLITEHNICA of Bucharest, Computer Science Department

• Decebal Popescu

  University POLITEHNICA of Bucharest, Computer Science Department

Recent IT research on prime numbers has focused on generating large primes forcryptography, neglecting the advancement of systematic generation of prime numbers insequence using techniques like sieving. Despite being relegated to educational contexts, sieving techniques hold untapped potential. Much of the existing work remains obscure to contemporaryresearchers, leaving numerous opportunities to enhance the field. This article aims to highlight the relevance of old sieving algorithms, demonstrating that modern approaches and creativity can yield significant progress.

DOI: 10.61416/ceai.v26i4.9098

• PDF