You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
pragma circom 2.0.0;
include "constants.circom"; include "sha256compression.circom";
template Sha256(nBits) { signal input in[nBits]; signal output out[256];
var i; var k; var nBlocks; var bitsLastBlock;
nBlocks = ((nBits + 64)\512)+1;
signal paddedIn[nBlocks*512];
for (k=0; k<nBits; k++) { paddedIn[k] <== in[k]; } paddedIn[nBits] <== 1;
for (k=nBits+1; k<nBlocks*512-64; k++) { paddedIn[k] <== 0; }
for (k = 0; k< 64; k++) { paddedIn[nBlocks*512 - k -1] <== (nBits >> k)&1; }
component ha0 = H(0); component hb0 = H(1); component hc0 = H(2); component hd0 = H(3); component he0 = H(4); component hf0 = H(5); component hg0 = H(6); component hh0 = H(7);
component sha256compression[nBlocks];
for (i=0; i<nBlocks; i++) {
sha256compression[i] = Sha256compression() ;
if (i==0) { for (k=0; k<32; k++ ) { sha256compression[i].hin[0*32+k] <== ha0.out[k]; sha256compression[i].hin[1*32+k] <== hb0.out[k]; sha256compression[i].hin[2*32+k] <== hc0.out[k]; sha256compression[i].hin[3*32+k] <== hd0.out[k]; sha256compression[i].hin[4*32+k] <== he0.out[k]; sha256compression[i].hin[5*32+k] <== hf0.out[k]; sha256compression[i].hin[6*32+k] <== hg0.out[k]; sha256compression[i].hin[7*32+k] <== hh0.out[k]; } } else { for (k=0; k<32; k++ ) { sha256compression[i].hin[32*0+k] <== sha256compression[i-1].out[32*0+31-k]; sha256compression[i].hin[32*1+k] <== sha256compression[i-1].out[32*1+31-k]; sha256compression[i].hin[32*2+k] <== sha256compression[i-1].out[32*2+31-k]; sha256compression[i].hin[32*3+k] <== sha256compression[i-1].out[32*3+31-k]; sha256compression[i].hin[32*4+k] <== sha256compression[i-1].out[32*4+31-k]; sha256compression[i].hin[32*5+k] <== sha256compression[i-1].out[32*5+31-k]; sha256compression[i].hin[32*6+k] <== sha256compression[i-1].out[32*6+31-k]; sha256compression[i].hin[32*7+k] <== sha256compression[i-1].out[32*7+31-k]; } }
for (k=0; k<512; k++) { sha256compression[i].inp[k] <== paddedIn[i*512+k]; } }
for (k=0; k<256; k++) { out[k] <== sha256compression[nBlocks-1].out[k]; }
}
|