BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
X-LIC-LOCATION:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260402T024532Z
LOCATION:3003\, Level 3
DTSTART;TZID=America/Los_Angeles:20250624T143000
DTEND;TZID=America/Los_Angeles:20250624T144500
UID:dac_DAC 2025_sess126_RESEARCH2297@linklings.com
SUMMARY:Optimizing windowed arithmetic for quantum attacks against RSA2048
DESCRIPTION:Alessandro Luongo (Center for Quantum Technologies (CQT)); Var
 un Narasimhachar (Agency for Science, Technology and Research (A*STAR)); a
 nd Adithya Sireesh (University of Edinburgh)\n\nWindowed arithmetic [Gid19
 ] uses precomputed lookup tables (LUTs) to reduce quantum-classical multip
 lication costs, achieving state-of-the-art resource estimates for integer 
 factoring [GE21]. We introduce four optimizations to enhance this approach
 , focusing on efficient uncomputation-of-lookups (unlookups), minimizing l
 ookups, and reducing table entries. These improvements reduce unlookup cos
 ts by ~50% for factoring, yielding a 16% runtime reduction with only a 12%
  qubit increase for RSA-2048. Our techniques provide broad utility in impr
 oving depth, runtime, and gate costs of quantum LUTs and windowed arithmet
 ic, enabling significant performance gains across diverse quantum algorith
 ms.\n\nTopics: Design\n\nTracks: DES6: Quantum Computing\n\nSession Chairs
 : Saurabh Kotiyal (Altera) and Sanjaya Lohani (Southern Methodist Universi
 ty)\n\n
END:VEVENT
END:VCALENDAR