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.

112 lines
2.7 KiB

  1. // signal input hin[256];
  2. // signal input inp[512];
  3. // signal output out[256];
  4. function rrot(x, n) {
  5. return ((x >> n) | (x << (32-n))) & 0xFFFFFFFF;
  6. }
  7. function bsigma0(x) {
  8. return rrot(x,2) ^ rrot(x,13) ^ rrot(x,22);
  9. }
  10. function bsigma1(x) {
  11. return rrot(x,6) ^ rrot(x,11) ^ rrot(x,25);
  12. }
  13. function ssigma0(x) {
  14. return rrot(x,7) ^ rrot(x,18) ^ (x >> 3);
  15. }
  16. function ssigma1(x) {
  17. return rrot(x,17) ^ rrot(x,19) ^ (x >> 10);
  18. }
  19. function Maj(x, y, z) {
  20. return (x&y) ^ (x&z) ^ (y&z);
  21. }
  22. function Ch(x, y, z) {
  23. return (x & y) ^ ((0xFFFFFFFF ^x) & z);
  24. }
  25. function sha256K(i) {
  26. var k[64] = [
  27. 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
  28. 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
  29. 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
  30. 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
  31. 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
  32. 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
  33. 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
  34. 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
  35. ];
  36. return k[i];
  37. }
  38. function sha256compression(hin, inp) {
  39. var H[8];
  40. var a;
  41. var b;
  42. var c;
  43. var d;
  44. var e;
  45. var f;
  46. var g;
  47. var h;
  48. var out[256];
  49. for (var i=0; i<8; i++) {
  50. H[i] = 0;
  51. for (var j=0; j<32; j++) {
  52. H[i] += hin[i*32+j] << j;
  53. }
  54. }
  55. a=H[0];
  56. b=H[1];
  57. c=H[2];
  58. d=H[3];
  59. e=H[4];
  60. f=H[5];
  61. g=H[6];
  62. h=H[7];
  63. var w[64];
  64. var T1;
  65. var T2;
  66. for (var i=0; i<64; i++) {
  67. if (i<16) {
  68. w[i]=0;
  69. for (var j=0; j<32; j++) {
  70. w[i] += inp[i*32+31-j]<<j;
  71. }
  72. } else {
  73. w[i] = (ssigma1(w[i-2]) + w[i-7] + ssigma0(w[i-15]) + w[i-16]) & 0xFFFFFFFF;
  74. }
  75. T1 = (h + bsigma1(e) + Ch(e,f,g) + sha256K(i) + w[i]) & 0xFFFFFFFF;
  76. T2 = (bsigma0(a) + Maj(a,b,c)) & 0xFFFFFFFF;
  77. h=g;
  78. g=f;
  79. f=e;
  80. e=(d+T1) & 0xFFFFFFFF;
  81. d=c;
  82. c=b;
  83. b=a;
  84. a=(T1+T2) & 0xFFFFFFFF;
  85. }
  86. H[0] = H[0] + a;
  87. H[1] = H[1] + b;
  88. H[2] = H[2] + c;
  89. H[3] = H[3] + d;
  90. H[4] = H[4] + e;
  91. H[5] = H[5] + f;
  92. H[6] = H[6] + g;
  93. H[7] = H[7] + h;
  94. for (var i=0; i<8; i++) {
  95. for (var j=0; j<32; j++) {
  96. out[i*32+31-j] = (H[i] >> j) & 1;
  97. }
  98. }
  99. return out;
  100. }