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:
It's said to be the safest encryption.
* * 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>>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;
}
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.