The search for ever-larger prime numbers
Austin W
Prime numbers are natural numbers larger than 1 with exactly two distinct positive divisors, 1 and themselves. Prime numbers have been studied for over two millennia, going back to Euclid’s proof by contradiction, circa 300 BCE, that there are infinitely many. In the modern era, however, primes have gathered practical use, as opposed to just intrinsic mathematical beauty. Their use spans across encryption systems, error detection codes used in data transmission, algorithms in computing and more. The current search for ever-larger prime numbers requires vast computational resources and huge funding, prompting the question: is this endeavour a matter of scientific necessity, with capabilities to improve modern applications, or is this effort sustained by mathematical curiosity, where the benefits may not warrant the considerable investment of time and resources? Today, the most prominent use of large prime numbers lies in cryptographic technology, particularly in the RSA encryption system. RSA is an encryption algorithm that enables secure communication on the internet. RSA employs public key cryptography, which is a system involving each user having a pair of keys, one of which is public and can be openly shared, and one of which is private and must remain secret. Messages encrypted via the public key can only be decrypted via the corresponding private key, which allows for confidentiality, even though the public key is widely distributed. The public key is created by multiplying two large primes together, while the private key is generated through a different process involving these same 2 prime numbers. A user can then distribute their public key, and then someone else can use it to send them a message. Although everyone can see the public key, only the user has the corresponding private key, which they are able to use when they receive the message in order to decrypt it and then read the original message. This system relies on the principle that multiplying large numbers is easy, but factorizing large numbers is very difficult, which makes it immensely difficult to decrypt the message without the private key, allowing for safe communication. However, with the advances in technology and development of more efficient factorization algorithms, RSA faces the risk of decryption through quantum algorithms or other advances in computing. There may be a way to factor the large number back into its original primes, which would lead the whole system to collapse. In order to prevent the risk, the search for ever larger prime numbers becomes essential in order to extend the time needed for factorization, therefore preserving the integrity of the RSA encryption system and allowing for continued safe online communication. The discovery of ever larger prime numbers poses significant challenges in both computation and mathematics. There are multiple methods for identifying new primes, but one of the most important tools is the Lucas-Lehmer test, which is tailored specifically to Mersenne numbers. These numbers hold the form (2^p)-1, where p is a prime number. These numbers are so special because they allow for much faster testing compared to general large prime numbers and, as a result, almost all the largest primes have this property. This includes the current largest prime found, of just over 41 million digits. This test streamlines calculations using modular arithmetic, making it feasible to test numbers with millions of digits, which would not be possible using other tests. The most notable modern search for large prime
68
Made with FlippingBook - PDF hosting