JS implementation of Base64 encryption, MD5 encryption and SHA1 encryption detailed _javascript skills

The example of this paper describes the Base64 encryption, MD5 encryption and SHA1 encryption implemented by JS. Share to everyone for your reference, specific as follows:

1, Base64 encryption

The Base64.js file is introduced into the page, and the method is called:

<! DOCTYPE html>
 
 

2, MD5 encryption

Referencing the Md5.js file in the page, calling the method

<! DOCTYPE html>
 
 

3, SHA1 encryption

It's said to be the safest encryption.

The page is introduced with Sha1.js, and the method is called

<! DOCTYPE html>
 
 

For the JS source code

Base64.js:

/** * * BASE64 encode/decode * * * @author haitao.tu * @date 2010-04-26 * @email tuhaitao@foxmail.com * */function Base6
 4 () {//private property _keystr = "abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz0123456789+/=";
  Public method for Encoding This.encode = function (input) {var output = "";
  var chr1, CHR2, CHR3, Enc1, Enc2, enc3, Enc4;
  var i = 0;
  input = _utf8_encode (input);
   while (I < input.length) {chr1 = Input.charcodeat (i++);
   CHR2 = Input.charcodeat (i++);
   CHR3 = Input.charcodeat (i++);
   ENC1 = Chr1 >> 2; ENC2 = ((Chr1 & 3) << 4) |
   (CHR2 >> 4); Enc3 = ((CHR2 &) << 2) |
   (CHR3 >> 6);
   Enc4 = CHR3 & 63;
   if (isNaN (CHR2)) {enc3 = Enc4 = 64;
   else if (isNaN (CHR3)) {Enc4 = 64;
  Output = output + _keystr.charat (ENC1) + _keystr.charat (ENC2) + _keystr.charat (enc3) + _keystr.charat (ENC4);
 return output; }//public to decoding This.decode = function (inPut) {var output = "";
  var chr1, CHR2, CHR3;
  var enc1, Enc2, enc3, Enc4;
  var i = 0;
  input = Input.replace (/[^a-za-z0-9\+\/\=]/g, "");
   while (I < input.length) {enc1 = _keystr.indexof (Input.charat (i++));
   ENC2 = _keystr.indexof (Input.charat (i++));
   enc3 = _keystr.indexof (Input.charat (i++));
   Enc4 = _keystr.indexof (Input.charat (i++)); CHR1 = (enc1 << 2) |
   (Enc2 >> 4); CHR2 = ((Enc2 &) << 4) |
   (enc3 >> 2); CHR3 = ((enc3 & 3) << 6) |
   Enc4;
   Output = output + String.fromCharCode (CHR1);
   if (enc3!=) {output = output + String.fromCharCode (CHR2);
   } if (Enc4!=) {output = output + String.fromCharCode (CHR3);
  } output = _utf8_decode (output);
 return output;
  }//Private method for UTF-8 encoding _utf8_encode = function (string) {string = String.Replace (/\r\n/g, "\ n");
  var utftext = "";
   for (var n = 0; n < string.length; n++) {var c = string.charcodeat (n); if (C <128) {Utftext + = String.fromCharCode (c);
    else if ((C > 127) && (C < 2048)) {Utftext + = String.fromCharCode ((c >> 6) | 192;
   Utftext + + String.fromCharCode ((C & 63) | 128);
    else {Utftext + = String.fromCharCode ((c >> 12) | 224);
    Utftext + + String.fromCharCode ((c >> 6) & 63) | 128;
   Utftext + + String.fromCharCode ((C & 63) | 128);
 } return utftext;
  }//Private method for UTF-8 decoding _utf8_decode = function (utftext) {var string = "";
  var i = 0;
  var c = C1 = C2 = 0;
   while (I < utftext.length) {c = utftext.charcodeat (i);
    if (c < 128) {string + = String.fromCharCode (c);
   i++;
    else if ((C > 191) && (C < 224)) {C2 = Utftext.charcodeat (i+1); String + String.fromCharCode (((C &) << 6) |
    (C2 & 63));
   i + 2;
    else {c2 = Utftext.charcodeat (i+1);
    C3 = Utftext.charcodeat (i+2); String + String.fromCharCode ((C &Amp ) << 12) | ((C2 &) << 6) |
    (C3 & 63));
   i + 3;
 } return string;

 }
}

Md5.js:

* * A JavaScript implementation of the RSA Data Security, Inc. MD5 message * Digest algorithm, as defined in RFC 1321.
 * Version 2.1 Copyright (C) Paul Johnston 1999-2002. * Other Contributors:greg Holt, Andrew Kepert, Ydnar, lostinet * Distributed under the BSD License * http://pajhome
 . org.uk/crypt/md5 for more info. * * * * configurable variables.
 You could need to tweak this compatible with * server-side, but the defaults work in most. * * var hexcase = 0; /* Hex output format. 0-lowercase; 1-uppercase * * var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */var Chrsz = 8; /* bits per input character. 8-ascii;  16-unicode * * * These are the functions "ll usually want to call * They take string arguments and return either Hex or BASE-64 encoded strings */function Hex_md5 (s) {return Binl2hex (CORE_MD5 (s), STR2BINL * s.length)); Chrsz On B64_MD5 (s) {return binl2b64 (CORE_MD5 (Str2binl (s), s.length * Chrsz));
function Str_md5 (s) {return binl2str (CORE_MD5 (Str2binl (s), s.length * chrsz))} function Hex_hmac_md5 (key, data) {return Binl2hex (CORE_HMAC_MD5 (key, data)); function B64_hmac_md5 (key, data) {return binl2b64 (CORE_HMAC_MD5 (key, data);} function Str_hmac_md5 (key, data) {Retur N Binl2str (CORE_HMAC_MD5 (key, data)); } * * Perform a simple self-test to, if the VM is working/function md5_vm_test () {return HEX_MD5 ("abc") = "900
150983cd24fb0d6963f7d28e17f72 "; } * * Calculate the MD5 of an array of Little-endian words, and a bit length/function core_md5 (x, len) {/* append
 padding * * X[len >> 5] |= 0x80 << ((len)% 32);
 X[((len +) >>> 9) << 4) + [] = Len;
 var a = 1732584193;
 var b =-271733879;
 var c =-1732584194;
 var d = 271733878;
 for (var i = 0; i < x.length i + =) {var Olda = A;
 var oldb = b;
 var oldc = c;
 var oldd = D;
 A = Md5_ff (A, B, C, D, x[i+ 0], 7,-680876936); D = md5_ff (d, a, B, C, x[i+ 1], 12,-389564586);
 c = md5_ff (c, D, a, B, x[i+ 2], 17, 606105819);
 b = md5_ff (b, C, D, A, x[i+ 3], 22,-1044525330);
 A = Md5_ff (A, B, C, D, x[i+ 4], 7,-176418897);
 D = md5_ff (d, a, B, C, x[i+ 5], 12, 1200080426);
 c = md5_ff (c, D, a, B, x[i+ 6], 17,-1473231341);
 b = md5_ff (b, C, D, A, x[i+ 7], 22,-45705983);
 A = Md5_ff (A, B, C, D, x[i+ 8], 7, 1770035416);
 D = md5_ff (d, a, B, C, x[i+ 9], 12,-1958414417);
 c = md5_ff (c, D, a, B, x[i+10], 17,-42063);
 b = md5_ff (b, C, D, A, x[i+11], 22,-1990404162);
 A = Md5_ff (A, B, C, D, X[i+12], 7, 1804603682);
 D = md5_ff (d, a, B, C, x[i+13], 12,-40341101);
 c = md5_ff (c, D, a, B, x[i+14], 17,-1502002290);
 b = md5_ff (b, C, D, A, x[i+15], 22, 1236535329);
 A = Md5_gg (A, B, C, D, x[i+ 1], 5,-165796510);
 D = Md5_gg (d, a, B, C, x[i+ 6], 9,-1069501632);
 c = Md5_gg (c, D, a, B, x[i+11], 14, 643717713);
 b = Md5_gg (b, C, D, A, x[i+ 0], 20,-373897302);
 A = Md5_gg (A, B, C, D, x[i+ 5], 5,-701558691);
 D = Md5_gg (d, a, B, C, x[i+10], 9, 38016083); C = Md5_gg (c, D, a, B, x[i+15], 14,-660478335);
 b = Md5_gg (b, C, D, A, x[i+ 4], 20,-405537848);
 A = Md5_gg (A, B, C, D, x[i+ 9], 5, 568446438);
 D = Md5_gg (d, a, B, C, x[i+14], 9,-1019803690);
 c = Md5_gg (c, D, a, B, x[i+ 3], 14,-187363961);
 b = Md5_gg (b, C, D, A, x[i+ 8], 20, 1163531501);
 A = Md5_gg (A, B, C, D, X[i+13], 5,-1444681467);
 D = Md5_gg (d, a, B, C, x[i+ 2], 9,-51403784);
 c = Md5_gg (c, D, a, B, x[i+ 7], 14, 1735328473);
 b = Md5_gg (b, C, D, A, x[i+12], 20,-1926607734);
 A = Md5_hh (A, B, C, D, x[i+ 5], 4,-378558);
 D = md5_hh (d, a, B, C, x[i+ 8], 11,-2022574463);
 c = md5_hh (c, D, a, B, x[i+11], 16, 1839030562);
 b = md5_hh (b, C, D, A, x[i+14], 23,-35309556);
 A = Md5_hh (A, B, C, D, x[i+ 1], 4,-1530992060);
 D = md5_hh (d, a, B, C, x[i+ 4], 11, 1272893353);
 c = md5_hh (c, D, a, B, x[i+ 7], 16,-155497632);
 b = md5_hh (b, C, D, A, x[i+10], 23,-1094730640);
 A = Md5_hh (A, B, C, D, X[i+13], 4, 681279174);
 D = md5_hh (d, a, B, C, x[i+ 0], 11,-358537222); C= Md5_hh (c, D, a, B, x[i+ 3], 16,-722521979);
 b = md5_hh (b, C, D, A, x[i+ 6], 23, 76029189);
 A = Md5_hh (A, B, C, D, x[i+ 9], 4,-640364487);
 D = md5_hh (d, a, B, C, x[i+12], 11,-421815835);
 c = md5_hh (c, D, a, B, x[i+15], 16, 530742520);
 b = md5_hh (b, C, D, A, x[i+ 2], 23,-995338651);
 A = Md5_ii (A, B, C, D, x[i+ 0], 6,-198630844);
 D = Md5_ii (d, a, B, C, x[i+ 7], 10, 1126891415);
 c = Md5_ii (c, D, a, B, x[i+14], 15,-1416354905);
 b = Md5_ii (b, C, D, A, x[i+ 5], 21,-57434055);
 A = Md5_ii (A, B, C, D, X[i+12], 6, 1700485571);
 D = Md5_ii (d, a, B, C, x[i+ 3], 10,-1894986606);
 c = Md5_ii (c, D, a, B, x[i+10], 15,-1051523);
 b = Md5_ii (b, C, D, A, x[i+ 1], 21,-2054922799);
 A = Md5_ii (A, B, C, D, x[i+ 8], 6, 1873313359);
 D = Md5_ii (d, a, B, C, x[i+15], 10,-30611744);
 c = Md5_ii (c, D, a, B, x[i+ 6], 15,-1560198380);
 b = Md5_ii (b, C, D, A, x[i+13], 21, 1309151649);
 A = Md5_ii (A, B, C, D, x[i+ 4], 6,-145523070);
 D = Md5_ii (d, a, B, C, x[i+11], 10,-1120210379); c =Md5_ii (c, D, a, B, x[i+ 2], 15, 718787259);
 b = Md5_ii (b, C, D, A, x[i+ 9], 21,-343485551);
 A = Safe_add (A, Olda);
 b = Safe_add (b, oldb);
 c = Safe_add (c, OLDC);
 D = Safe_add (d, OLDD);
Return Array (A, B, C, D);
 /* * These functions implement the four basic operations the algorithm uses. /function Md5_cmn (q, A, B, X, S, t) {return safe_add (Bit_rol (Safe_add (Safe_add (A, Q), Safe_add (x, T), s), b); functi On Md5_ff (A, B, C, D, X, S, t) {return md5_cmn (b & c) |
((~b) & D), A, B, X, S, T); function Md5_gg (A, B, C, D, X, S, t) {return MD5_CMN (b & D) |
(C & (~d)), A, B, X, S, T); 
function Md5_hh (A, B, C, D, X, S, t) {return md5_cmn (b ^ C ^ D, a, B, X, S, t);} function Md5_ii (A, B, C, D, X, S, t) {return md5_cmn (c ^) (b |
(~d)), A, B, X, S, T);
 } * * Calculate the HMAC-MD5, a key and some data/function core_hmac_md5 (key, data) {var bkey = str2binl (key);
 if (Bkey.length >) bkey = Core_md5 (Bkey, key.length * chrsz); var ipad = ArraY (), Opad = Array (16);
 for (var i = 0; i < i++) {Ipad[i] = bkey[i] ^ 0x36363636;
 Opad[i] = bkey[i] ^ 0x5c5c5c5c;
 var hash = core_md5 (str2binl (data), Ipad.concat + data.length * chrsz);
Return Core_md5 (Opad.concat (hash), 512 + 128); * * * Add integers, wrapping at 2^32.
 This is uses 16-bit operations internally * To work around bugs in some JS interpreters.
 */function Safe_add (x, y) {var LSW = (x & 0xFFFF) + (Y & 0xFFFF);
 var MSW = (x >>) + (y >>) + (LSW >> 16); Return (MSW << 16) |
(LSW & 0xFFFF);
 /* * Bitwise rotate a 32-bit number to the left. */function Bit_rol (num, cnt) {return (num << cnt) |
(Num >>> (32-cnt)); }/* Convert A string to an array of Little-endian words * If Chrsz is ASCII, characters >255 have their hi-byte si
 Lently ignored.
 */function Str2binl (str) {var bin = Array ();
 var mask = (1 << chrsz)-1; for (var i = 0; i < str.length * Chrsz i + = chrsz) biN[I&GT;&GT;5] |= (Str.charcodeat (I/chrsz) & Mask) << (i%32);
return bin;
 }/* Convert an array of Little-endian words to a string/function binl2str (BIN) {var str = "";
 var mask = (1 << chrsz)-1; for (var i = 0; i < bin.length * i + = chrsz) str + string.fromcharcode ((bin[i>>5) >>> (i%)) &am P
 mask);
return str;
 /* * Convert an array of Little-endian words to a hex string. */function Binl2hex (BinArray) {var hex_tab = hexcase?
 "0123456789ABCDEF": "0123456789abcdef";
 var str = ""; for (var i = 0; i < binarray.length * 4; i++) {str + hex_tab.charat ((binarray[i>>2) >> ((i%4) *8+4)) ;
 0xF) + Hex_tab.charat ((Binarray[i>>2] >> ((i%4) *8)) & 0xF);
return str; } * * Convert an array of Little-endian words to a base-64 string/function binl2b64 (binarray) {var tab = ABCDEFGH
 ijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz0123456789+/";
 var str = ""; for (var i = 0; i < BinArray. length * 4; i + + 3 {var triplet = ((binarray[i >> 2] >> 8 * (i%4) & 0xFF) << 16 | (((binarray[i+1 >> 2] >> 8 * ((i+1)%4) & 0xFF) << 8) |
 ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF);
  for (var j = 0; J < 4; J +) {if (I * 8 + J * 6 > Binarray.length *) str + = B64pad;
 else str = Tab.charat ((triplet >> 6* (3-j)) & 0x3F);
} return str;

 }

Sha1.js:

* * A JavaScript implementation of the Secure Hash algorithm, SHA-1, as defined * in FIPS PUB 180-1 * Version 2.1-bet
 A Copyright Paul Johnston 2000-2002. * Other Contributors:greg Holt, Andrew Kepert, Ydnar, lostinet * Distributed under the BSD License * http://pajhome
 . ORG.UK/CRYPT/MD5 for details. * * * * configurable variables.
 You could need to tweak this compatible with * server-side, but the defaults work in most. * * var hexcase = 0; /* Hex output format. 0-lowercase; 1-uppercase * * var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */var Chrsz = 8; /* bits per input character. 8-ascii; 16-unicode * * * These are the functions "ll usually want to call * They take string arguments and return eith 
ER hex or BASE-64 encoded strings */function Hex_sha1 (s) {return Binb2hex (CORE_SHA1 (STR2BINB (s), s.length * Chrsz)); function B64_sha1 (s) {return binb2b64 (CORE_SHA1 (STR2BINB (s), s.length * Chrsz);} funCtion STR_SHA1 (s) {return binb2str (CORE_SHA1 (STR2BINB (s), s.length * chrsz)); function hex_hmac_sha1 (key, data) {RET
Urn Binb2hex (CORE_HMAC_SHA1 (key, data));
 function B64_hmac_sha1 (key, data) {return binb2b64 (CORE_HMAC_SHA1 (key, data);} function Str_hmac_sha1 (key, data) {
Return Binb2str (key, data) (CORE_HMAC_SHA1); } * * Perform a simple self-test to, if the VM is working/function sha1_vm_test () {return HEX_SHA1 ("abc") = "a"
9993e364706816aba3e25717850c26c9cd0d89d "; } * * Calculate the SHA-1 of an array of Big-endian words, and a bit length/function core_sha1 (x, len) {/* append
 padding * * X[len >> 5] |= 0x80 << (24-len% 32);
 x[(len + >> 9) << 4) = Len;
 var w = Array (80);
 var a = 1732584193;
 var b =-271733879;
 var c =-1732584194;
 var d = 271733878;
 var e =-1009589776;
  for (var i = 0; i < x.length i + =) {var Olda = A;
  var oldb = b;
  var oldc = c;
  var oldd = D;
  var olde = e; for (var j = 0; j < 80;
   J + +) {if (J <) W[j] = X[i + j];
   else w[j] = Rol (w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1);
   var t = safe_add (Safe_add (Rol (A, 5), sha1_ft (J, B, C, D)), Safe_add (Safe_add (E, w[j)), Sha1_kt (j)));
   e = D;
   D = C;
   c = Rol (b, 30);
   b = A;
  A = t;
  A = Safe_add (A, Olda);
  b = Safe_add (b, oldb);
  c = Safe_add (c, OLDC);
  D = Safe_add (d, OLDD);
 E = Safe_add (e, Olde);
Return Array (A, B, C, D, E);  } * * Perform the appropriate triplet combination function for the current * iteration * function sha1_ft (t, B, C, D) {if (T <) return (b & c) |
 ((~b) & D);
 if (T <) return b ^ C ^ D; if (T < a) return (b & c) | (b & D) |
 (C & D);
Return b ^ C ^ D; } * * Determine the appropriate additive constant for the current iteration/function Sha1_kt (t) {return (T < 20 ) ? 1518500249: (T < 40)? 1859775393: (T < 60)?
-1894007588:-899497514; } * * Calculate the HMAC-SHA1 of a key and some data
 */function CORE_HMAC_SHA1 (key, data) {var bkey = str2binb (key);
 if (Bkey.length >) bkey = CORE_SHA1 (Bkey, key.length * chrsz);
 var ipad = array, Opad = Array (16);
  for (var i = 0; i < i++) {Ipad[i] = bkey[i] ^ 0x36363636;
 Opad[i] = bkey[i] ^ 0x5c5c5c5c;
 var hash = CORE_SHA1 (str2binb (data), Ipad.concat + data.length * chrsz);
Return Core_sha1 (Opad.concat (hash), 512 + 160); * * * Add integers, wrapping at 2^32.
 This is uses 16-bit operations internally * To work around bugs in some JS interpreters.
 */function Safe_add (x, y) {var LSW = (x & 0xFFFF) + (Y & 0xFFFF);
 var MSW = (x >>) + (y >>) + (LSW >> 16); Return (MSW << 16) |
(LSW & 0xFFFF);
 /* * Bitwise rotate a 32-bit number to the left. */function Rol (num, cnt) {return (num << cnt) |
(Num >>> (32-cnt)); }/* Convert an 8-bit or 16-bit string to a array of Big-endian words * in 8-bit function, characters >255 have th EiR Hi-byte silently ignored.
 */function Str2binb (str) {var bin = Array ();
 var mask = (1 << chrsz)-1; for (var i = 0; i < str.length * Chrsz i + = Chrsz) bin[i >> 5] |= (Str.charcodeat (I/chrsz) & mask) &LT;&L T
 (24-i% 32);
return bin;
 }/* Convert an array of Big-endian words to a string/function binb2str (BIN) {var str = "";
 var mask = (1 << chrsz)-1; for (var i = 0; i < bin.length * i + + = Chrsz) str + string.fromcharcode ((bin[i >> 5] >>> (24-i%
 )) & mask);
return str;
 /* * Convert an array of Big-endian words to a hex string. */function Binb2hex (BinArray) {var hex_tab = hexcase?
 "0123456789ABCDEF": "0123456789abcdef";
 var str = "";  for (var i = 0; i < binarray.length * 4; i++) {str = Hex_tab.charat (binarray[i >> 2] >> ((3-i% 4) *
 8 + 4)) & 0xF) + Hex_tab.charat ((binarray[i >> 2] >> ((3-i% 4) * 8)) & 0xF);
return str; }/* Convert an arrayof Big-endian words to a base-64 String */function binb2b64 (binarray) {var tab = ' Abcdefghijklmnopqrstuvwxyzabcdefghij
 klmnopqrstuvwxyz0123456789+/";
 var str = ""; for (var i = 0; i < binarray.length * 4; i + + 3) {var triplet = ((binarray[i >> 2] >> 8 * (3-i% 4)) & 0xFF) << 16) | (((binarray[i + 1 >> 2] >> 8 * (3-(i + 1)% 4)) & 0xFF) << 8 |
  ((Binarray[i + 2 >> 2] >> 8 * (3-(i + 2)% 4)) & 0xFF);
   for (var j = 0; J < 4; J +) {if (I * 8 + J * 6 > Binarray.length *) str + = B64pad;
  else str = Tab.charat ((triplet >> 6 * (3-J)) & 0x3F);
} return str;

 }

friends who are interested in JavaScript encryption can also refer to this site's online tools :

MD5 Online Encryption Tool

Escape Encryption/Decryption tool

Online SHA1 Encryption Tool

Thunderbolt, Express, Cyclone URL encryption/decryption tool

Password Security online detection

High Strength Password Generator

More about JavaScript content to view the site topics: "JavaScript encryption and decryption skills summary", "JavaScript switching effects and techniques summary", "JavaScript Search Algorithm Skills Summary", "JavaScript animation effects and tips Summary , JavaScript error and debugging skills Summary, JavaScript data structure and algorithm skills summary, JavaScript traversal algorithm and skills summary, and "JavaScript Mathematical Computing Usage Summary"

I hope this article will help you with JavaScript programming.