Is brute force SHA-1 possible?

Question

Encryption

Only 2^64 options need to be iterated over, which seems crazy at first glance, but for SHA-256 (bitcoin) there are miners at 4.86th/s , i.e. brute force 2^64/4.86th/s=43days, but this is for SHA-256, and the algorithm is hardcoded in ASIC, are there similar miners for SHA-1?

Answer 1

Maybe FPGA to help. 2^64 can be counted even on a couple of hundred CPU cores, and if you don’t take the standard implementation of the hash yet ...