• DocumentCode
    2896904
  • Title

    Enhancing COPACOBANA for advanced applications in cryptography and cryptanalysis

  • Author

    Güneysu, Tim ; Paar, Christof ; Pfeiffer, Gerd ; Schimmler, Manfred

  • Author_Institution
    Horst Gortz Inst. for IT Security, Ruhr Univ. Bochum, Bochum
  • fYear
    2008
  • fDate
    8-10 Sept. 2008
  • Firstpage
    675
  • Lastpage
    678
  • Abstract
    Cryptanalysis of symmetric and asymmetric ciphers is a challenging task due to the enormous amount of involved computations. To tackle this computational complexity, usually the employment of special-purpose hardware is considered as best approach. We have built a massively parallel cluster system (COPACOBANA) based on low-cost FPGAs as a cost-efficient platform primarily targeting cryptanalytical operations with these high computational efforts but low communication and memory requirements. However, some parallel applications in the field of cryptography are too complex for low-cost FPGAs and also require the availability of at least moderate communication and memory facilities. Particularly, this holds true for arithmetic intensive application as well as ones with a highly complex data flow. In this contribution, we describe a novel architecture for a more versatile and reliable COPACOBANA capable to host advanced cryptographic applications like high-performance digital signature generation according to the elliptic curve digital signature algorithm (ECDSA) and integer factorization based on the elliptic curve method (ECM). In addition to that, the new cluster design allows even to run more supercomputing applications beyond the field of cryptography.
  • Keywords
    computational complexity; cryptography; elliptic equations; field programmable gate arrays; COPACOBANA; FPGA; arithmetic intensive application; asymmetric ciphers; computational complexity; cryptanalysis; cryptography; digital signature generation; elliptic curve digital signature algorithm; elliptic curve method; integer factorization; parallel cluster system; Arithmetic; Availability; Computational complexity; Concurrent computing; Digital signatures; Elliptic curve cryptography; Elliptic curves; Employment; Field programmable gate arrays; Hardware;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Field Programmable Logic and Applications, 2008. FPL 2008. International Conference on
  • Conference_Location
    Heidelberg
  • Print_ISBN
    978-1-4244-1960-9
  • Electronic_ISBN
    978-1-4244-1961-6
  • Type

    conf

  • DOI
    10.1109/FPL.2008.4630037
  • Filename
    4630037