BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6abf030554396
DTSTART;TZID=America/Toronto:20261002T170000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261002T180000
URL:https://uwaterloo.ca/pure-mathematics/events/grad-student-colloquium-ow
 en-sharpe-primality-testing-easy
SUMMARY:Grad Student Colloquium | Owen Sharpe | Primality Testing Is Easy b
 ut\nFactoring Is Hard
CLASS:PUBLIC
DESCRIPTION:OWEN SHARPE (UNIVERSITY OF WATERLOO)\n\n_Primality Testing Is E
 asy but Factoring Is Hard_ \nYou've probably heard of RSA\, and that it re
 lies on factoring being a\nhard problem\, but did you ever wonder where th
 e large primes come from\nin the first place? We will take a tour through 
 primality testing and\nfactoring algorithms\, starting with trial factorin
 g and the sieve of\nEratosthenes\, through probabilistic methods like the 
 Miller-Rabin\nprobabilistic test and the Pollard rho method\, to the bleed
 ing edge of\nAKS and the quadratic sieve. \nMC 5417
DTSTAMP:20261002T010405Z
END:VEVENT
END:VCALENDAR