June 19, 2018
4:00PM - 5:00PM
Scott Lab N054
Add to Calendar
2018-06-19 16:00:00
2018-06-19 17:00:00
What is...? Seminar - Sohail Farhangi
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
Scott Lab N054
OSU ASC Drupal 8
ascwebservices@osu.edu
America/New_York
public
Date Range
Add to Calendar
2018-06-19 16:00:00
2018-06-19 17:00:00
What is...? Seminar - Sohail Farhangi
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
Scott Lab N054
Department of Mathematics
math@osu.edu
America/New_York
public
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