Factoring: An attack on RSA encryption
November 12, 2003
Bailey Hall 100
The RSA public-key encryption algorithm provides the security for much of the data transmission in today's electronic society, including financial transactions over the web. The security of RSA depends on the difficulty of factoring large integers, and thus has given new impetus to the study of the factoring problem. In this talk, I will discuss the quadratic sieve factoring algorithm, which is a beautiful and simple method invented by Carl Pomerance in the early eighties.
|Union College Math Department Home Page|
Comments to: firstname.lastname@example.org
Created automatically on: Sun Apr 22 04:17:16 EDT 2018