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

Algorithms for collision search in finite sets are a key tool for security assessment of modern real world crypto-systems. Two notable applications of collision search are the Pollard rho algorithm to solve the elliptic curve discrete logarithm problem (ECDLP) and the birthday search for finding collisions of cryptographic hash functions like MD5 and SHA1. The ability to design and implement efficient hardware architectures for such algorithms can have a significant impact on the practical security of a variety of crypto-systems submitted in the real world.