Theoretical minimum # of logic operations to perform double iterated SHA256?

Question

What is the theoretical minimum number of logical operations an ASIC needs to perform to compute double iterated SHA256, i.e., sha(sha(•))?

Is this the best way to phrase the question? It seems like you'd want to know 1) the number of gates required to implement it, and 2) how much it can be pipelined (probably quite a lot.) — Nick ODell, Apr 19 '15 at 08:33

score 3 · Accepted Answer · edited Jun 16 '20 at 11:10

3

SHA256D, which is what Bitcoin uses, is 128 rounds, comprising

768 additions,

640 ORs

896 XORs

And a bunch of bit shifts but bit shifts are free on an ASIC.

(source)

edited Jun 16 '20 at 11:10

Community

1

answered Apr 19 '15 at 05:25

Geremia

4,626
5
38
75

Those numbers don't seem correct. I count 522 additions across one iteration of SHA256, for example. (1044 across two) http://en.wikipedia.org/wiki/SHA-2#Pseudocode – Nick ODell Apr 19 '15 at 08:32
1

...and I'm counting 600 additions for one SHA256 block: 48*3 + 64*7 + 8. Honestly I think this should be closed as off-topic and re-posted to http://crypto.stackexchange.com/ where you could attract the attention of a crypto expert. – Christopher Gurnee Apr 19 '15 at 15:03

Theoretical minimum # of logic operations to perform double iterated SHA256?

1 Answers1