Efficient many-core architecture design for cryptanalytic collision search on FPGAs

We present a general many-core architecture and an optimization methodology thereof, for cryptanalytic collision search on Field Programmable Gate Arrays (FPGAs). We use such architecture for two relevant case studies, i.e., (i) the Pollard rho algorithm to solve the ECDLP for security assessment of elliptic curve cryptography (ECC), and (ii) the birthday search algorithm to find chosen-prefix collisions for security assessment of the MD5 cryptographic hash function.