Enhancing COPACOBANA for advanced applications in cryptography and cryptanalysis

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.

[1]  Jean-Jacques Quisquater,et al.  Integer Factorization Based on Elliptic Curve Method: Towards Better Exploitation of Reconfigurable Hardware , 2007, 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2007).

[2]  尚弘 島影 National Institute of Standards and Technologyにおける超伝導研究及び生活 , 2001 .

[3]  P. L. Montgomery Modular multiplication without trial division , 1985 .

[4]  Manfred Schimmler,et al.  Hardware Enhanced Biosequence Alignment , 2005, METMBS.

[5]  Christof Paar,et al.  High-Radix Montgomery Modular Exponentiation on Reconfigurable Hardware , 2001, IEEE Trans. Computers.

[6]  Daisuke Suzuki,et al.  How to Maximize the Potential of FPGA Resources for Modular Exponentiation , 2007, CHES.

[7]  Jean-Jacques Quisquater,et al.  Integer Factorization Based on Elliptic Curve Method: Towards Better Exploitation of Reconfigurable Hardware , 2007 .

[8]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[9]  Christof Paar,et al.  A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware , 2001, CHES.

[10]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[11]  Christof Paar,et al.  Breaking Ciphers with COPACOBANA - A Cost-Optimized Parallel Code Breaker , 2006, CHES.

[12]  Tim Güneysu,et al.  Attacking elliptic curve cryptosystems with special-purpose hardware , 2007, FPGA '07.

[13]  Philip Heng Wai Leong,et al.  A Smith-Waterman Systolic Cell , 2003, FPL.

[14]  Milos Drutarovský,et al.  Hardware factorization based on elliptic curve method , 2005, 13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'05).

[15]  Tim Güneysu,et al.  Ultra High Performance ECC over NIST Primes on Commercial FPGAs , 2008, CHES.

[16]  H. W. Lenstra,et al.  Factoring integers with elliptic curves , 1987 .

[17]  Tim Güneysu,et al.  Breaking Legacy Banking Standards with Special-Purpose Hardware , 2008, Financial Cryptography.

[18]  Patrick Baier,et al.  Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware , 2006, CHES.

[19]  Christof Paar,et al.  E-Passport : Cracking Basic Access Control Keys with COPACOBANA ⋆ , 2007 .