AMUSE

Date: February 28, 2018

Time: 6:00PM - 7:00PM

Location: BLOC 220

Speaker: Dr. Andrew Bridy, Texas A&M University, Department of Mathematics

Title: Integer Factorization and Cryptography

Abstract: The security of modern cryptography largely depends on the fact that factoring integers is a computationally expensive problem (at least, until quantum computers become practical). We will discuss the difficulty of factoring, as well as some factoring algorithms that are significantly faster than the naive "trial division" method.