BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1664
DTSTAMP:20260209T062332Z
SUMMARY:Finding an Element of High Order Modulo a Composite
DESCRIPTION:Speaker: Ben Lee Volk (Reichman University)\n\nAbstract: \nWe w
 ill discuss a deterministic algorithm that\, given a composite number N an
 d a target order D ≥ N^{1/6}\, runs in time D^{1/2+o(1)} and finds eithe
 r an element of multiplicative order at least D\, or a nontrivial factor o
 f N. Our algorithm improves upon an algorithm of Hittmeir (2018)\, who gav
 e an algorithm with similar guarantees under stronger assumptions. Hittmei
 r's algorithm played a crucial role in the recent breakthrough determinist
 ic integer factorization algorithms of Hittmeir and Harvey (2020\, 2021).B
 ased on a joint work with Ziv Oznovich.\n \nShort Bio: Ben Lee Volk is a 
 member of the faculty at the School of Computer Science at Reichman Univer
 sity in Israel. He did his PhD at Tel Aviv University and spent his postdo
 c years at Caltech and UT Austin before moving to Reichman. His research i
 nterests are broadly in computational complexity\, with a particular focus
  on algebraic complexity\, algorithms for algebraic problems\, error corre
 cting codes and pseudorandomness.\n
URL:https://www.tcs.tifr.res.in/web/events/1664
DTSTART;TZID=Asia/Kolkata:20260210T160000
DTEND;TZID=Asia/Kolkata:20260210T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR