3 ms·
More or less, yes, that is my implication. Luckily, my sibling comment provides some extra information. For the example of SHA-1 computation, you mention usin
by currymesurprise 13y ago
More or less, yes, that is my implication. Luckily, my sibling comment provides some extra information.
For the example of SHA-1 computation, you mention using FPGAs that finish in 400 clock cycles, which is at most an order of magnitude away from a naive CPU implementation of around 4000 clock cycles. I'm not as familiar with SHA-256.