The Sieve of Eratosthenes is an ancient algorithm used to find all prime numbers up to a specified integer by iteratively marking the multiples of each prime number starting from 2. It efficiently eliminates non-prime numbers in a range by progressively marking the multiples of each prime, resulting in a list of primes up to the desired limit.