One of the first asymmetric cryptosystems invented was RSA (1977). But why is it necessary to find large prime numbers in the area of cryptography? Prime numbers are integers \(p\) which are dividable only by \(p\) itself and \(1\). We hopefully are all familiar with the concept of prime numbers. In this article, I am going to dig into a interesting area of cryptography: The task to find large prime numbers.
It has been a long time since I found the energy to write a new blog post. The most recent version of the sources may only be found in the Github repository. All sources for this blog post can be found in the Github repository about large primes.
