BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Harder\, Better\, Faster\, Stronger - Elliptic Curve Discrete Loga
 rithm Computations on FPGAs - Erich Wenger\, Graz University of Technology
 \, Austria
DTSTART:20150420T090000Z
DTEND:20150420T100000Z
UID:TALK59031@talks.cam.ac.uk
CONTACT:Robert Mullins
DESCRIPTION:Computing discrete logarithms takes time. It takes time to dev
 elop new algorithms\, choose the best algorithms\, implement these algorit
 hms correctly and efficiently\, keep the system running for several months
 \, and\, finally\, publish the results. In this paper\, we present a highl
 y performant architecture that can be used to compute discrete logarithms 
 of Weierstrass curves defined over binary fields and Koblitz curves using 
 FPGAs. We used the architecture to compute for the first time a discrete l
 ogarithm of the elliptic curve "sect113r1"\, a previously standardized bin
 ary curve\, using 10 Kintex-7 FPGAs. To achieve this result\, we investiga
 ted different iteration functions\, used a negation map\, dealt with the f
 ruitless cycle problem\, built an efficient FPGA design that processes 900
  million iterations per second\, and we tended for several months the opti
 mized implementations running on the FPGAs.
LOCATION:SC04\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR