Tuesday, June 19, 2018 - 4:00pm to 5:00pm
Scott Lab N054
Title: What is the Continued Fraction Factoring Method?
Speaker: Sohail Farhangi (Ohio State University)
Abstract: The security of many ciphers in cryptography rely on the difficulty of factoring large numbers efficiently. For a while, all known factoring algorithms had running times that were exponential with respect to the number of digits of the prime being factored. The continued fraction factoring method was the first factoring algorithm that had an asymptotically sub-exponential running time, and is the basis for many other modern factoring algorithms.
Seminar URL: https://math.osu.edu/whatis