• DocumentCode
    2213690
  • Title

    Breaking Elliptic Curve Cryptosystems Using Reconfigurable Hardware

  • Author

    Fan, Junfeng ; Bailey, Daniel V. ; Batina, Lejla ; Güneysu, Tim ; Paar, Christof ; Verbauwhede, Ingrid

  • Author_Institution
    ESAF/SCD-COSIC, Katholieke Univ. Leuven, Leuven, Belgium
  • fYear
    2010
  • fDate
    Aug. 31 2010-Sept. 2 2010
  • Firstpage
    133
  • Lastpage
    138
  • 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.
  • Keywords
    field programmable gate arrays; public key cryptography; Certicom challenge ECC2K-130; FPGA performance; elliptic curve cryptosystem; optimized normal basis multiplier; reconfigurable hardware; Certicom Challenge; Elliptic Curve Cryptography; FPGA;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Field Programmable Logic and Applications (FPL), 2010 International Conference on
  • Conference_Location
    Milano
  • ISSN
    1946-1488
  • Print_ISBN
    978-1-4244-7842-2
  • Type

    conf

  • DOI
    10.1109/FPL.2010.34
  • Filename
    5694233
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2213690