Wednesday, March 17, 2021 - 06:30

Zoom

### Abstract or Additional Information

Prime numbers have a surprising number of applications in computer science, including hashing, random number generation, and cryptography. Because of this, we often need to generate prime numbers and test numbers for primality. Some of these applications require very large prime numbers, which are difficult to quickly test for primality, meaning we need to take care to use efficient primality tests. I will introduce several primality testing algorithms and evaluate the efficiency of each when dealing with large numbers