Integer factorization (breaking down whole numbers into prime factors) is something computers do constantly, yet it's surprisingly hard. Have you ever considered why this is the case?

This talk traces integer factorization from Fermat's 17th-century breakthrough to today's General Number Field Sieve (GNFS). We'll demystify how this mathematical monster works without drowning in theory, and we'll explore notable moments in cryptographic history and the relationship between factorization algorithms and cybersecurity. Although the GNFS is an absurdly complex mathematical topic, this talk will make it accessible to everyone.

Fair warning: there WILL be mathematics in this talk... but there will also be history, hacking, and horseplay. No prior math experience required—just a healthy respect for algorithms and some patience. I promise this will be way cooler than your high school algebra class (and yes, I realize how low that bar might already be).