Code666 (代码贴、代码片段)

[JavaScript] JavaScript SHA512加密算法详细代码 →→→→→进入此内容的聊天室

来自 , 2019-03-31, 写在 JavaScript, 查看 118 次.
URL http://www.code666.cn/view/b14573b9
  1. /*
  2.  * A JavaScript implementation of the Secure Hash Algorithm, SHA-512, as defined
  3.  * in FIPS 180-2
  4.  * Version 2.2 Copyright Anonymous Contributor, Paul Johnston 2000 - 2009.
  5.  * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
  6.  * Distributed under the BSD License
  7.  * See http://pajhome.org.uk/crypt/md5 for details.
  8.  * http://www.sharejs.com/codes
  9.  */
  10.  
  11. /*
  12.  * Configurable variables. You may need to tweak these to be compatible with
  13.  * the server-side, but the defaults work in most cases.
  14.  */
  15. var hexcase = 0;  /* hex output format. 0 - lowercase; 1 - uppercase        */
  16. var b64pad  = ""; /* base-64 pad character. "=" for strict RFC compliance   */
  17.  
  18. /*
  19.  * These are the functions you'll usually want to call
  20.  * They take string arguments and return either hex or base-64 encoded strings
  21.  */
  22. function hex_sha512(s)    { return rstr2hex(rstr_sha512(str2rstr_utf8(s))); }
  23. function b64_sha512(s)    { return rstr2b64(rstr_sha512(str2rstr_utf8(s))); }
  24. function any_sha512(s, e) { return rstr2any(rstr_sha512(str2rstr_utf8(s)), e);}
  25. function hex_hmac_sha512(k, d)
  26.   { return rstr2hex(rstr_hmac_sha512(str2rstr_utf8(k), str2rstr_utf8(d))); }
  27. function b64_hmac_sha512(k, d)
  28.   { return rstr2b64(rstr_hmac_sha512(str2rstr_utf8(k), str2rstr_utf8(d))); }
  29. function any_hmac_sha512(k, d, e)
  30.   { return rstr2any(rstr_hmac_sha512(str2rstr_utf8(k), str2rstr_utf8(d)), e);}
  31.  
  32. /*
  33.  * Perform a simple self-test to see if the VM is working
  34.  */
  35. function sha512_vm_test()
  36. {
  37.   return hex_sha512("abc").toLowerCase() ==
  38.     "ddaf35a193617abacc417349ae20413112e6fa4e89a97ea20a9eeee64b55d39a" +
  39.     "2192992a274fc1a836ba3c23a3feebbd454d4423643ce80e2a9ac94fa54ca49f";
  40. }
  41.  
  42. /*
  43.  * Calculate the SHA-512 of a raw string
  44.  */
  45. function rstr_sha512(s)
  46. {
  47.   return binb2rstr(binb_sha512(rstr2binb(s), s.length * 8));
  48. }
  49.  
  50. /*
  51.  * Calculate the HMAC-SHA-512 of a key and some data (raw strings)
  52.  */
  53. function rstr_hmac_sha512(key, data)
  54. {
  55.   var bkey = rstr2binb(key);
  56.   if(bkey.length > 32) bkey = binb_sha512(bkey, key.length * 8);
  57.  
  58.   var ipad = Array(32), opad = Array(32);
  59.   for(var i = 0; i < 32; i++)
  60.   {
  61.     ipad[i] = bkey[i] ^ 0x36363636;
  62.     opad[i] = bkey[i] ^ 0x5C5C5C5C;
  63.   }
  64.  
  65.   var hash = binb_sha512(ipad.concat(rstr2binb(data)), 1024 + data.length * 8);
  66.   return binb2rstr(binb_sha512(opad.concat(hash), 1024 + 512));
  67. }
  68.  
  69. /*
  70.  * Convert a raw string to a hex string
  71.  */
  72. function rstr2hex(input)
  73. {
  74.   try { hexcase } catch(e) { hexcase=0; }
  75.   var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
  76.   var output = "";
  77.   var x;
  78.   for(var i = 0; i < input.length; i++)
  79.   {
  80.     x = input.charCodeAt(i);
  81.     output += hex_tab.charAt((x >>> 4) & 0x0F)
  82.            +  hex_tab.charAt( x        & 0x0F);
  83.   }
  84.   return output;
  85. }
  86.  
  87. /*
  88.  * Convert a raw string to a base-64 string
  89.  */
  90. function rstr2b64(input)
  91. {
  92.   try { b64pad } catch(e) { b64pad=''; }
  93.   var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
  94.   var output = "";
  95.   var len = input.length;
  96.   for(var i = 0; i < len; i += 3)
  97.   {
  98.     var triplet = (input.charCodeAt(i) << 16)
  99.                 | (i + 1 < len ? input.charCodeAt(i+1) << 8 : 0)
  100.                 | (i + 2 < len ? input.charCodeAt(i+2)      : 0);
  101.     for(var j = 0; j < 4; j++)
  102.     {
  103.       if(i * 8 + j * 6 > input.length * 8) output += b64pad;
  104.       else output += tab.charAt((triplet >>> 6*(3-j)) & 0x3F);
  105.     }
  106.   }
  107.   return output;
  108. }
  109.  
  110. /*
  111.  * Convert a raw string to an arbitrary string encoding
  112.  */
  113. function rstr2any(input, encoding)
  114. {
  115.   var divisor = encoding.length;
  116.   var i, j, q, x, quotient;
  117.  
  118.   /* Convert to an array of 16-bit big-endian values, forming the dividend */
  119.   var dividend = Array(Math.ceil(input.length / 2));
  120.   for(i = 0; i < dividend.length; i++)
  121.   {
  122.     dividend[i] = (input.charCodeAt(i * 2) << 8) | input.charCodeAt(i * 2 + 1);
  123.   }
  124.  
  125.   /*
  126.    * Repeatedly perform a long division. The binary array forms the dividend,
  127.    * the length of the encoding is the divisor. Once computed, the quotient
  128.    * forms the dividend for the next step. All remainders are stored for later
  129.    * use.
  130.    */
  131.   var full_length = Math.ceil(input.length * 8 /
  132.                                     (Math.log(encoding.length) / Math.log(2)));
  133.   var remainders = Array(full_length);
  134.   for(j = 0; j < full_length; j++)
  135.   {
  136.     quotient = Array();
  137.     x = 0;
  138.     for(i = 0; i < dividend.length; i++)
  139.     {
  140.       x = (x << 16) + dividend[i];
  141.       q = Math.floor(x / divisor);
  142.       x -= q * divisor;
  143.       if(quotient.length > 0 || q > 0)
  144.         quotient[quotient.length] = q;
  145.     }
  146.     remainders[j] = x;
  147.     dividend = quotient;
  148.   }
  149.  
  150.   /* Convert the remainders to the output string */
  151.   var output = "";
  152.   for(i = remainders.length - 1; i >= 0; i--)
  153.     output += encoding.charAt(remainders[i]);
  154.  
  155.   return output;
  156. }
  157.  
  158. /*
  159.  * Encode a string as utf-8.
  160.  * For efficiency, this assumes the input is valid utf-16.
  161.  */
  162. function str2rstr_utf8(input)
  163. {
  164.   var output = "";
  165.   var i = -1;
  166.   var x, y;
  167.  
  168.   while(++i < input.length)
  169.   {
  170.     /* Decode utf-16 surrogate pairs */
  171.     x = input.charCodeAt(i);
  172.     y = i + 1 < input.length ? input.charCodeAt(i + 1) : 0;
  173.     if(0xD800 <= x && x <= 0xDBFF && 0xDC00 <= y && y <= 0xDFFF)
  174.     {
  175.       x = 0x10000 + ((x & 0x03FF) << 10) + (y & 0x03FF);
  176.       i++;
  177.     }
  178.  
  179.     /* Encode output as utf-8 */
  180.     if(x <= 0x7F)
  181.       output += String.fromCharCode(x);
  182.     else if(x <= 0x7FF)
  183.       output += String.fromCharCode(0xC0 | ((x >>> 6 ) & 0x1F),
  184.                                     0x80 | ( x         & 0x3F));
  185.     else if(x <= 0xFFFF)
  186.       output += String.fromCharCode(0xE0 | ((x >>> 12) & 0x0F),
  187.                                     0x80 | ((x >>> 6 ) & 0x3F),
  188.                                     0x80 | ( x         & 0x3F));
  189.     else if(x <= 0x1FFFFF)
  190.       output += String.fromCharCode(0xF0 | ((x >>> 18) & 0x07),
  191.                                     0x80 | ((x >>> 12) & 0x3F),
  192.                                     0x80 | ((x >>> 6 ) & 0x3F),
  193.                                     0x80 | ( x         & 0x3F));
  194.   }
  195.   return output;
  196. }
  197.  
  198. /*
  199.  * Encode a string as utf-16
  200.  */
  201. function str2rstr_utf16le(input)
  202. {
  203.   var output = "";
  204.   for(var i = 0; i < input.length; i++)
  205.     output += String.fromCharCode( input.charCodeAt(i)        & 0xFF,
  206.                                   (input.charCodeAt(i) >>> 8) & 0xFF);
  207.   return output;
  208. }
  209.  
  210. function str2rstr_utf16be(input)
  211. {
  212.   var output = "";
  213.   for(var i = 0; i < input.length; i++)
  214.     output += String.fromCharCode((input.charCodeAt(i) >>> 8) & 0xFF,
  215.                                    input.charCodeAt(i)        & 0xFF);
  216.   return output;
  217. }
  218.  
  219. /*
  220.  * Convert a raw string to an array of big-endian words
  221.  * Characters >255 have their high-byte silently ignored.
  222.  */
  223. function rstr2binb(input)
  224. {
  225.   var output = Array(input.length >> 2);
  226.   for(var i = 0; i < output.length; i++)
  227.     output[i] = 0;
  228.   for(var i = 0; i < input.length * 8; i += 8)
  229.     output[i>>5] |= (input.charCodeAt(i / 8) & 0xFF) << (24 - i % 32);
  230.   return output;
  231. }
  232.  
  233. /*
  234.  * Convert an array of big-endian words to a string
  235.  */
  236. function binb2rstr(input)
  237. {
  238.   var output = "";
  239.   for(var i = 0; i < input.length * 32; i += 8)
  240.     output += String.fromCharCode((input[i>>5] >>> (24 - i % 32)) & 0xFF);
  241.   return output;
  242. }
  243.  
  244. /*
  245.  * Calculate the SHA-512 of an array of big-endian dwords, and a bit length
  246.  */
  247. var sha512_k;
  248. function binb_sha512(x, len)
  249. {
  250.   if(sha512_k == undefined)
  251.   {
  252.     //SHA512 constants
  253.     sha512_k = new Array(
  254. new int64(0x428a2f98, -685199838), new int64(0x71374491, 0x23ef65cd),
  255. new int64(-1245643825, -330482897), new int64(-373957723, -2121671748),
  256. new int64(0x3956c25b, -213338824), new int64(0x59f111f1, -1241133031),
  257. new int64(-1841331548, -1357295717), new int64(-1424204075, -630357736),
  258. new int64(-670586216, -1560083902), new int64(0x12835b01, 0x45706fbe),
  259. new int64(0x243185be, 0x4ee4b28c), new int64(0x550c7dc3, -704662302),
  260. new int64(0x72be5d74, -226784913), new int64(-2132889090, 0x3b1696b1),
  261. new int64(-1680079193, 0x25c71235), new int64(-1046744716, -815192428),
  262. new int64(-459576895, -1628353838), new int64(-272742522, 0x384f25e3),
  263. new int64(0xfc19dc6, -1953704523), new int64(0x240ca1cc, 0x77ac9c65),
  264. new int64(0x2de92c6f, 0x592b0275), new int64(0x4a7484aa, 0x6ea6e483),
  265. new int64(0x5cb0a9dc, -1119749164), new int64(0x76f988da, -2096016459),
  266. new int64(-1740746414, -295247957), new int64(-1473132947, 0x2db43210),
  267. new int64(-1341970488, -1728372417), new int64(-1084653625, -1091629340),
  268. new int64(-958395405, 0x3da88fc2), new int64(-710438585, -1828018395),
  269. new int64(0x6ca6351, -536640913), new int64(0x14292967, 0xa0e6e70),
  270. new int64(0x27b70a85, 0x46d22ffc), new int64(0x2e1b2138, 0x5c26c926),
  271. new int64(0x4d2c6dfc, 0x5ac42aed), new int64(0x53380d13, -1651133473),
  272. new int64(0x650a7354, -1951439906), new int64(0x766a0abb, 0x3c77b2a8),
  273. new int64(-2117940946, 0x47edaee6), new int64(-1838011259, 0x1482353b),
  274. new int64(-1564481375, 0x4cf10364), new int64(-1474664885, -1136513023),
  275. new int64(-1035236496, -789014639), new int64(-949202525, 0x654be30),
  276. new int64(-778901479, -688958952), new int64(-694614492, 0x5565a910),
  277. new int64(-200395387, 0x5771202a), new int64(0x106aa070, 0x32bbd1b8),
  278. new int64(0x19a4c116, -1194143544), new int64(0x1e376c08, 0x5141ab53),
  279. new int64(0x2748774c, -544281703), new int64(0x34b0bcb5, -509917016),
  280. new int64(0x391c0cb3, -976659869), new int64(0x4ed8aa4a, -482243893),
  281. new int64(0x5b9cca4f, 0x7763e373), new int64(0x682e6ff3, -692930397),
  282. new int64(0x748f82ee, 0x5defb2fc), new int64(0x78a5636f, 0x43172f60),
  283. new int64(-2067236844, -1578062990), new int64(-1933114872, 0x1a6439ec),
  284. new int64(-1866530822, 0x23631e28), new int64(-1538233109, -561857047),
  285. new int64(-1090935817, -1295615723), new int64(-965641998, -479046869),
  286. new int64(-903397682, -366583396), new int64(-779700025, 0x21c0c207),
  287. new int64(-354779690, -840897762), new int64(-176337025, -294727304),
  288. new int64(0x6f067aa, 0x72176fba), new int64(0xa637dc5, -1563912026),
  289. new int64(0x113f9804, -1090974290), new int64(0x1b710b35, 0x131c471b),
  290. new int64(0x28db77f5, 0x23047d84), new int64(0x32caab7b, 0x40c72493),
  291. new int64(0x3c9ebe0a, 0x15c9bebc), new int64(0x431d67c4, -1676669620),
  292. new int64(0x4cc5d4be, -885112138), new int64(0x597f299c, -60457430),
  293. new int64(0x5fcb6fab, 0x3ad6faec), new int64(0x6c44198c, 0x4a475817));
  294.   }
  295.  
  296.   //Initial hash values
  297.   var H = new Array(
  298. new int64(0x6a09e667, -205731576),
  299. new int64(-1150833019, -2067093701),
  300. new int64(0x3c6ef372, -23791573),
  301. new int64(-1521486534, 0x5f1d36f1),
  302. new int64(0x510e527f, -1377402159),
  303. new int64(-1694144372, 0x2b3e6c1f),
  304. new int64(0x1f83d9ab, -79577749),
  305. new int64(0x5be0cd19, 0x137e2179));
  306.  
  307.   var T1 = new int64(0, 0),
  308.     T2 = new int64(0, 0),
  309.     a = new int64(0,0),
  310.     b = new int64(0,0),
  311.     c = new int64(0,0),
  312.     d = new int64(0,0),
  313.     e = new int64(0,0),
  314.     f = new int64(0,0),
  315.     g = new int64(0,0),
  316.     h = new int64(0,0),
  317.     //Temporary variables not specified by the document
  318.     s0 = new int64(0, 0),
  319.     s1 = new int64(0, 0),
  320.     Ch = new int64(0, 0),
  321.     Maj = new int64(0, 0),
  322.     r1 = new int64(0, 0),
  323.     r2 = new int64(0, 0),
  324.     r3 = new int64(0, 0);
  325.   var j, i;
  326.   var W = new Array(80);
  327.   for(i=0; i<80; i++)
  328.     W[i] = new int64(0, 0);
  329.  
  330.   // append padding to the source string. The format is described in the FIPS.
  331.   x[len >> 5] |= 0x80 << (24 - (len & 0x1f));
  332.   x[((len + 128 >> 10)<< 5) + 31] = len;
  333.  
  334.   for(i = 0; i<x.length; i+=32) //32 dwords is the block size
  335.   {
  336.     int64copy(a, H[0]);
  337.     int64copy(b, H[1]);
  338.     int64copy(c, H[2]);
  339.     int64copy(d, H[3]);
  340.     int64copy(e, H[4]);
  341.     int64copy(f, H[5]);
  342.     int64copy(g, H[6]);
  343.     int64copy(h, H[7]);
  344.  
  345.     for(j=0; j<16; j++)
  346.     {
  347.         W[j].h = x[i + 2*j];
  348.         W[j].l = x[i + 2*j + 1];
  349.     }
  350.  
  351.     for(j=16; j<80; j++)
  352.     {
  353.       //sigma1
  354.       int64rrot(r1, W[j-2], 19);
  355.       int64revrrot(r2, W[j-2], 29);
  356.       int64shr(r3, W[j-2], 6);
  357.       s1.l = r1.l ^ r2.l ^ r3.l;
  358.       s1.h = r1.h ^ r2.h ^ r3.h;
  359.       //sigma0
  360.       int64rrot(r1, W[j-15], 1);
  361.       int64rrot(r2, W[j-15], 8);
  362.       int64shr(r3, W[j-15], 7);
  363.       s0.l = r1.l ^ r2.l ^ r3.l;
  364.       s0.h = r1.h ^ r2.h ^ r3.h;
  365.  
  366.       int64add4(W[j], s1, W[j-7], s0, W[j-16]);
  367.     }
  368.  
  369.     for(j = 0; j < 80; j++)
  370.     {
  371.       //Ch
  372.       Ch.l = (e.l & f.l) ^ (~e.l & g.l);
  373.       Ch.h = (e.h & f.h) ^ (~e.h & g.h);
  374.  
  375.       //Sigma1
  376.       int64rrot(r1, e, 14);
  377.       int64rrot(r2, e, 18);
  378.       int64revrrot(r3, e, 9);
  379.       s1.l = r1.l ^ r2.l ^ r3.l;
  380.       s1.h = r1.h ^ r2.h ^ r3.h;
  381.  
  382.       //Sigma0
  383.       int64rrot(r1, a, 28);
  384.       int64revrrot(r2, a, 2);
  385.       int64revrrot(r3, a, 7);
  386.       s0.l = r1.l ^ r2.l ^ r3.l;
  387.       s0.h = r1.h ^ r2.h ^ r3.h;
  388.  
  389.       //Maj
  390.       Maj.l = (a.l & b.l) ^ (a.l & c.l) ^ (b.l & c.l);
  391.       Maj.h = (a.h & b.h) ^ (a.h & c.h) ^ (b.h & c.h);
  392.  
  393.       int64add5(T1, h, s1, Ch, sha512_k[j], W[j]);
  394.       int64add(T2, s0, Maj);
  395.  
  396.       int64copy(h, g);
  397.       int64copy(g, f);
  398.       int64copy(f, e);
  399.       int64add(e, d, T1);
  400.       int64copy(d, c);
  401.       int64copy(c, b);
  402.       int64copy(b, a);
  403.       int64add(a, T1, T2);
  404.     }
  405.     int64add(H[0], H[0], a);
  406.     int64add(H[1], H[1], b);
  407.     int64add(H[2], H[2], c);
  408.     int64add(H[3], H[3], d);
  409.     int64add(H[4], H[4], e);
  410.     int64add(H[5], H[5], f);
  411.     int64add(H[6], H[6], g);
  412.     int64add(H[7], H[7], h);
  413.   }
  414.  
  415.   //represent the hash as an array of 32-bit dwords
  416.   var hash = new Array(16);
  417.   for(i=0; i<8; i++)
  418.   {
  419.     hash[2*i] = H[i].h;
  420.     hash[2*i + 1] = H[i].l;
  421.   }
  422.   return hash;
  423. }
  424.  
  425. //A constructor for 64-bit numbers
  426. function int64(h, l)
  427. {
  428.   this.h = h;
  429.   this.l = l;
  430.   //this.toString = int64toString;
  431. }
  432.  
  433. //Copies src into dst, assuming both are 64-bit numbers
  434. function int64copy(dst, src)
  435. {
  436.   dst.h = src.h;
  437.   dst.l = src.l;
  438. }
  439.  
  440. //Right-rotates a 64-bit number by shift
  441. //Won't handle cases of shift>=32
  442. //The function revrrot() is for that
  443. function int64rrot(dst, x, shift)
  444. {
  445.     dst.l = (x.l >>> shift) | (x.h << (32-shift));
  446.     dst.h = (x.h >>> shift) | (x.l << (32-shift));
  447. }
  448.  
  449. //Reverses the dwords of the source and then rotates right by shift.
  450. //This is equivalent to rotation by 32+shift
  451. function int64revrrot(dst, x, shift)
  452. {
  453.     dst.l = (x.h >>> shift) | (x.l << (32-shift));
  454.     dst.h = (x.l >>> shift) | (x.h << (32-shift));
  455. }
  456.  
  457. //Bitwise-shifts right a 64-bit number by shift
  458. //Won't handle shift>=32, but it's never needed in SHA512
  459. function int64shr(dst, x, shift)
  460. {
  461.     dst.l = (x.l >>> shift) | (x.h << (32-shift));
  462.     dst.h = (x.h >>> shift);
  463. }
  464.  
  465. //Adds two 64-bit numbers
  466. //Like the original implementation, does not rely on 32-bit operations
  467. function int64add(dst, x, y)
  468. {
  469.    var w0 = (x.l & 0xffff) + (y.l & 0xffff);
  470.    var w1 = (x.l >>> 16) + (y.l >>> 16) + (w0 >>> 16);
  471.    var w2 = (x.h & 0xffff) + (y.h & 0xffff) + (w1 >>> 16);
  472.    var w3 = (x.h >>> 16) + (y.h >>> 16) + (w2 >>> 16);
  473.    dst.l = (w0 & 0xffff) | (w1 << 16);
  474.    dst.h = (w2 & 0xffff) | (w3 << 16);
  475. }
  476.  
  477. //Same, except with 4 addends. Works faster than adding them one by one.
  478. function int64add4(dst, a, b, c, d)
  479. {
  480.    var w0 = (a.l & 0xffff) + (b.l & 0xffff) + (c.l & 0xffff) + (d.l & 0xffff);
  481.    var w1 = (a.l >>> 16) + (b.l >>> 16) + (c.l >>> 16) + (d.l >>> 16) + (w0 >>> 16);
  482.    var w2 = (a.h & 0xffff) + (b.h & 0xffff) + (c.h & 0xffff) + (d.h & 0xffff) + (w1 >>> 16);
  483.    var w3 = (a.h >>> 16) + (b.h >>> 16) + (c.h >>> 16) + (d.h >>> 16) + (w2 >>> 16);
  484.    dst.l = (w0 & 0xffff) | (w1 << 16);
  485.    dst.h = (w2 & 0xffff) | (w3 << 16);
  486. }
  487.  
  488. //Same, except with 5 addends
  489. function int64add5(dst, a, b, c, d, e)
  490. {
  491.    var w0 = (a.l & 0xffff) + (b.l & 0xffff) + (c.l & 0xffff) + (d.l & 0xffff) + (e.l & 0xffff);
  492.    var w1 = (a.l >>> 16) + (b.l >>> 16) + (c.l >>> 16) + (d.l >>> 16) + (e.l >>> 16) + (w0 >>> 16);
  493.    var w2 = (a.h & 0xffff) + (b.h & 0xffff) + (c.h & 0xffff) + (d.h & 0xffff) + (e.h & 0xffff) + (w1 >>> 16);
  494.    var w3 = (a.h >>> 16) + (b.h >>> 16) + (c.h >>> 16) + (d.h >>> 16) + (e.h >>> 16) + (w2 >>> 16);
  495.    dst.l = (w0 & 0xffff) | (w1 << 16);
  496.    dst.h = (w2 & 0xffff) | (w3 << 16);
  497. }
  498. //javascript/8904

回复 "JavaScript SHA512加密算法详细代码"

这儿你可以回复上面这条便签

captcha

贴代码片段 - Code666