What is the Fastest Prime Number Algorithm?
Floor Location : 010502
We live in an age where we frequently use the internet. Usually, we want some of the information stored there to be private. Prime numbers are very frequently used in encrypting information. In my science project, I researched five ways of finding prime numbers: Trial Division, GCD, the Fermat test, the Solovay-Strassen test, and a fifth test that I created on my own. What I have found is that the Fermat and Solovay-Strassen tests are the fastest. Using this information, we can either try and make Fermat and Solovay-Strassen tests faster, or we can test them against more modern tests.