I researched the efficiency of modern algorithms that test whether large integers are prime or not. As it turns out, this question is fundamental to modern cryptography: many modern encryption algorithms used for internet security purposes require a steady supply of large prime numbers. Although many different primality tests are used in cryptography, I focused on the strong Lucas pseudoprime test, which relies on concepts from algebraic number theory. To begin working on my project, I did over a month of background reading on algebraic number theory.

Read More

• Mathematics