BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//PKI Consortium//Conference Agenda//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Post-Quantum Cryptography Conference
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VEVENT
UID:agenda-3273544e-a079-4e79-a699-7d3123006113@ics.pkic.org
SEQUENCE:0
DTSTAMP:20261023T000842Z
DTSTART:20261203T083500Z
DTEND:20261203T091500Z
STATUS:CONFIRMED
SUMMARY:How AI Is Compressing the Cryptographic Threat Timeline
DESCRIPTION:**Abstract**\n\nThis talk looks at three recent results that to
 gether change the outlook for cryptographic risk.\n\nIt starts with classic
 al factoring. Two RSA Challenge records fell within sixteen days in Septemb
 er 2026: first RSA-260 (862 bits)\, then RSA-896. Both were factored with t
 he general number field sieve\, a method that is decades old\, after AI cod
 ing agents ported it to large GPU clusters. The talk will explain why the m
 athematics stayed the same while AI-accelerated engineering on AI hardware 
 still changed the economics of attacking legacy RSA-1024 keys.\n\nThe secon
 d part covers AI-driven cryptanalysis of post-quantum candidates. In July 2
 026\, an AI research agent found a classical key-recovery attack on HAWK\, 
 a third-round candidate in NIST's additional signatures process. The attack
  exploits a Galois symmetry that halves the dimension of the lattice proble
 m. It recovered HAWK-256 keys in hours on a single server\, and the designe
 rs withdrew the scheme the next day. The same week\, AI-driven analysis als
 o improved the best known attack on 7-round AES. The talk will consider wha
 t these results mean for how much confidence to place in new algorithms.\n\
 nThe third part looks at AI improving quantum attacks themselves. [ECDSA.fa
 il](http://ECDSA.fail) was an open challenge where human researchers and AI
  agents competed to optimise the quantum circuit for elliptic-curve point a
 ddition\, the core step in Shor's attack on ECDSA. In eight weeks\, logical
  qubits fell by 58% and the Toffoli gate count by 67%\, compared with the p
 ublished Google baseline. The talk will show how this widens the gap betwee
 n ECC and RSA timelines\, with elliptic-curve systems reaching the quantum 
 threshold sooner.\n\nThe talk closes with what this means in practice for m
 igration planners:\n\n- RSA-2048 holds today\, but RSA-1024 does not.\n- Al
 gorithm maturity and crypto-agility now matter more than any single scheme.
 \n- ECC-protected assets deserve priority.\n- Some parts of migration plans
  should change now.\n\nSpeakers: Michael Osborne
LOCATION:Blue hall
CATEGORIES:Blue hall
URL:https://pkic.org/events/2026/pqc-conference-amsterdam-nl/agenda/
END:VEVENT
END:VCALENDAR