Published in

2010 International Conference on Field Programmable Logic and Applications

DOI: 10.1109/fpl.2010.34

Links

Tools

Export citation

Search in Google Scholar

Breaking elliptic curve cryptosystems using reconfigurable hardware

Journal article published in 2010 by Junfeng Fan, Daniel V. Bailey, Lejla Batina, Fabrizio Ferrandi, Tim Güneysu, Christof Paar, Marco D. Santambrogio, Ingrid M. R. Verbauwhede, Jari Nurmi
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

This paper reports a new speed record for FPGAs in cracking Elliptic Curve Cryptosystems. We conduct a detailed analysis of different F2(m) multiplication approaches in this application. A novel architecture using optimized normal basis multipliers is proposed to solve the Certicom challenge ECC2K-130. We compare the FPGA performance against CPUs, GPUs, and the Sony PlayStation 3. Our implementations show low-cost FPGAs outperform even multicore desktop processors and graphics cards by a factor of 2.