ch := (e and f) xor ((not e) and g)
The 'not' operation is bitwise negation. Every 1 bit becomes a zero, every zero becomes a one.
Topic: Where can I find... (Read 855 times)
After 3 cups of cofee and few hours of looking I think that finally I'm getting to understand that algorithm. Correct me if I'm wrong.
A to H are 32bit variables with 0h00000000 value at the begining. Wt and Kt are input values (data and nonce in terms of bitcoin?) After all operations (Ch function, Ma function, sigmas, modulo additions) result is moved to variable A and rest of them are moved one position. This happens 64 times and result of SHA256 operation is in A to H registers. Only unknown to me is that strange operand in Ch function (before second E). Is it NOT operand? Its not listed in table beneth.
TIA.
A to H are 32bit variables with 0h00000000 value at the begining. Wt and Kt are input values (data and nonce in terms of bitcoin?) After all operations (Ch function, Ma function, sigmas, modulo additions) result is moved to variable A and rest of them are moved one position. This happens 64 times and result of SHA256 operation is in A to H registers. Only unknown to me is that strange operand in Ch function (before second E). Is it NOT operand? Its not listed in table beneth.
TIA.
Middle of that page, middle of the pseudo-code, starting from "Initialize hash value for this chunk" and going on until "Add this chunk's result to the hash so far". Basically, it just does a bunch of bitwise operations to 'mash' all the data into the running hash total.
Well, I've looked at that before. And it didn't helped me. Things get even more complicated to me 
...exact description of one SHA256 round. I've found some algorithms but that doesn't helped me. Maybe you will know where to look. Step by step description would be best...
TIA.
TIA.
Jump to: