<script language="JavaScript">
/*****************************************************************************
 * md5.js
 *
 * A JavaScript implementation of the RSA Data Security, Inc. MD5
 * Message-Digest Algorithm.
 *
 * Copyright (C) Paul Johnston 1999. Distributed under the LGPL.
 *****************************************************************************/

/* to convert strings to a list of ascii values */
var sAscii = " !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ"
var sAscii = sAscii + "[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~";

/* convert integer to hex string */
var sHex = "0123456789ABCDEF";
function hex(i) {
        h = "";
        for(j = 0; j <= 3; j++) {
                h += sHex.charAt((i >> (j * 8 + 4)) & 0x0F) +
                        sHex.charAt((i >> (j * 8)) & 0x0F);
        }
        return h;
}

/* add, handling overflows correctly */
function add(x, y) {
        return ((x&0x7FFFFFFF) + (y&0x7FFFFFFF)) ^ (x&0x80000000) ^ (y&0x80000000);
}

/* MD5 rounds functions */
function R1(A, B, C, D, X, S, T) {
        q = add(add(A, (B & C) | (~B & D)), add(X, T));
        return add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B);
}

function R2(A, B, C, D, X, S, T) {
        q = add(add(A, (B & D) | (C & ~D)), add(X, T));
        return add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B);
}

function R3(A, B, C, D, X, S, T) {
        q = add(add(A, B ^ C ^ D), add(X, T));
        return add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B);
}

function R4(A, B, C, D, X, S, T) {
        q = add(add(A, C ^ (B | ~D)), add(X, T));
        return add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B);
}

/* main entry point */
function calcMD5(sInp) {

/* Calculate length in machine words, including padding */
        wLen = (((sInp.length + 8) >> 6) + 1) << 4;
        var X = new Array(wLen);

/* Convert string to array of words */
        j = 4;
        for (i = 0; (i * 4) < sInp.length; i++) {
                X[i] = 0;
                for (j = 0; (j < 4) && ((j + i * 4) < sInp.length); j++) {
                        X[i] += (sAscii.indexOf(sInp.charAt((i * 4) + j)) + 32) << (j * 8);
                }
        }

/* Append padding bits and length */
        if (j == 4) {
                X[i++] = 0x80;
        }
        else {
                X[i - 1] += 0x80 << (j * 8);
        }
        for(; i < wLen; i++) {
                X[i] = 0;
        }
        X[wLen - 2] = sInp.length * 8;

/* hard-coded initial values */
        a = 0x67452301;
        b = 0xefcdab89;
        c = 0x98badcfe;
        d = 0x10325476;

/* Process each 16-word block in turn */
        for (i = 0; i < wLen; i += 16) {
                aO = a;
                bO = b;
                cO = c;
                dO = d;

a = R1(a, b, c, d, X[i+ 0], 7 , 0xd76aa478);
                d = R1(d, a, b, c, X[i+ 1], 12, 0xe8c7b756);
                c = R1(c, d, a, b, X[i+ 2], 17, 0x242070db);
                b = R1(b, c, d, a, X[i+ 3], 22, 0xc1bdceee);
                a = R1(a, b, c, d, X[i+ 4], 7 , 0xf57c0faf);
                d = R1(d, a, b, c, X[i+ 5], 12, 0x4787c62a);
                c = R1(c, d, a, b, X[i+ 6], 17, 0xa8304613);
                b = R1(b, c, d, a, X[i+ 7], 22, 0xfd469501);
                a = R1(a, b, c, d, X[i+ 8], 7 , 0x698098d8);
                d = R1(d, a, b, c, X[i+ 9], 12, 0x8b44f7af);
                c = R1(c, d, a, b, X[i+10], 17, 0xffff5bb1);
                b = R1(b, c, d, a, X[i+11], 22, 0x895cd7be);
                a = R1(a, b, c, d, X[i+12], 7 , 0x6b901122);
                d = R1(d, a, b, c, X[i+13], 12, 0xfd987193);
                c = R1(c, d, a, b, X[i+14], 17, 0xa679438e);
                b = R1(b, c, d, a, X[i+15], 22, 0x49b40821);

a = R2(a, b, c, d, X[i+ 1], 5 , 0xf61e2562);
                d = R2(d, a, b, c, X[i+ 6], 9 , 0xc040b340);
                c = R2(c, d, a, b, X[i+11], 14, 0x265e5a51);
                b = R2(b, c, d, a, X[i+ 0], 20, 0xe9b6c7aa);
                a = R2(a, b, c, d, X[i+ 5], 5 , 0xd62f105d);
                d = R2(d, a, b, c, X[i+10], 9 , 0x2441453);
                c = R2(c, d, a, b, X[i+15], 14, 0xd8a1e681);
                b = R2(b, c, d, a, X[i+ 4], 20, 0xe7d3fbc8);
                a = R2(a, b, c, d, X[i+ 9], 5 , 0x21e1cde6);
                d = R2(d, a, b, c, X[i+14], 9 , 0xc33707d6);
                c = R2(c, d, a, b, X[i+ 3], 14, 0xf4d50d87);
                b = R2(b, c, d, a, X[i+ 8], 20, 0x455a14ed);
                a = R2(a, b, c, d, X[i+13], 5 , 0xa9e3e905);
                d = R2(d, a, b, c, X[i+ 2], 9 , 0xfcefa3f8);
                c = R2(c, d, a, b, X[i+ 7], 14, 0x676f02d9);
                b = R2(b, c, d, a, X[i+12], 20, 0x8d2a4c8a);

a = R3(a, b, c, d, X[i+ 5], 4 , 0xfffa3942);
                d = R3(d, a, b, c, X[i+ 8], 11, 0x8771f681);
                c = R3(c, d, a, b, X[i+11], 16, 0x6d9d6122);
                b = R3(b, c, d, a, X[i+14], 23, 0xfde5380c);
                a = R3(a, b, c, d, X[i+ 1], 4 , 0xa4beea44);
                d = R3(d, a, b, c, X[i+ 4], 11, 0x4bdecfa9);
                c = R3(c, d, a, b, X[i+ 7], 16, 0xf6bb4b60);
                b = R3(b, c, d, a, X[i+10], 23, 0xbebfbc70);
                a = R3(a, b, c, d, X[i+13], 4 , 0x289b7ec6);
                d = R3(d, a, b, c, X[i+ 0], 11, 0xeaa127fa);
                c = R3(c, d, a, b, X[i+ 3], 16, 0xd4ef3085);
                b = R3(b, c, d, a, X[i+ 6], 23, 0x4881d05);
                a = R3(a, b, c, d, X[i+ 9], 4 , 0xd9d4d039);
                d = R3(d, a, b, c, X[i+12], 11, 0xe6db99e5);
                c = R3(c, d, a, b, X[i+15], 16, 0x1fa27cf8);
                b = R3(b, c, d, a, X[i+ 2], 23, 0xc4ac5665);

a = R4(a, b, c, d, X[i+ 0], 6 , 0xf4292244);
                d = R4(d, a, b, c, X[i+ 7], 10, 0x432aff97);
                c = R4(c, d, a, b, X[i+14], 15, 0xab9423a7);
                b = R4(b, c, d, a, X[i+ 5], 21, 0xfc93a039);
                a = R4(a, b, c, d, X[i+12], 6 , 0x655b59c3);
                d = R4(d, a, b, c, X[i+ 3], 10, 0x8f0ccc92);
                c = R4(c, d, a, b, X[i+10], 15, 0xffeff47d);
                b = R4(b, c, d, a, X[i+ 1], 21, 0x85845dd1);
                a = R4(a, b, c, d, X[i+ 8], 6 , 0x6fa87e4f);
                d = R4(d, a, b, c, X[i+15], 10, 0xfe2ce6e0);
                c = R4(c, d, a, b, X[i+ 6], 15, 0xa3014314);
                b = R4(b, c, d, a, X[i+13], 21, 0x4e0811a1);
                a = R4(a, b, c, d, X[i+ 4], 6 , 0xf7537e82);
                d = R4(d, a, b, c, X[i+11], 10, 0xbd3af235);
                c = R4(c, d, a, b, X[i+ 2], 15, 0x2ad7d2bb);
                b = R4(b, c, d, a, X[i+ 9], 21, 0xeb86d391);

a = add(a, aO);
                b = add(b, bO);
                c = add(c, cO);
                d = add(d, dO);
        }
       
        return hex(a) + hex(b) + hex(c) + hex(d);
}
</script>
<input type="text" id="m"><input type=button value="md5加密" onclick=alert(calcMD5(m.value))>

js MD5加密后的字符串的更多相关文章

  1. md5sum 生成 经md5加密后的字符串

    ➜ ~ echo -n 'admin' | md5sum 21232f297a57a5a743894a0e4a801fc3 - ➜ ~ md5sum -h md5sum: invalid option ...

  2. java 32位MD5加密的大写字符串

    package com.aok.test; import java.security.MessageDigest; public class MD5Test { public static void ...

  3. java字符串MD5加密后再转16进制

    话不多说上码 pom.xml <!-- MD5 --> <dependency> <groupId>org.apache.commons</groupId&g ...

  4. Java和JS MD5加密-附盐值加密demo

    JAVA和JS的MD5加密 经过测试:字母和数据好使,中文不好使. 源码如下: ** * 类MD5Util.java的实现描述: * */public class MD5Util { // 获得MD5 ...

  5. 使用JAVA进行MD5加密后所遇到的一些问题

    前言:这几天在研究apache shiro如何使用,这好用到了给密码加密的地方,就碰巧研究了下java的MD5加密是如何实现的,下面记录下我遇到的一些小问题. 使用java进行MD5加密非常的简单,代 ...

  6. js MD5加密处理

    关于MD5: MD5.js是通过前台js加密的方式对用户信息,密码等私密信息进行加密处理的工具,也可称为插件. 在本案例中 可以看到MD5共有6种加密方法: 1,  hex_md5(value) 2, ...

  7. js MD5加密与 java MD5加密不一致

    因为该项目会部署到多台机器,所以需要用字符生成唯一的MD5,但是js生成的MD5和java生成的MD5不一致.经过博主查阅资料发现java生成MD5用的是utf-8的编码,而且js用的是2进制.那我就 ...

  8. md5加密后不能解密

    MD5加密原理是散列算法,散列算法也称哈希算法.计算机专业学的数据结构就有哈希表这一知识点.比如10除以3余数为一,4除以3余数也为一,但余数为一的就不知道这个数是哪个了.所以md5不能解密.就算是设 ...

  9. ios 常用的正则表达式（手机号邮箱md5加密验证空字符串等）

    可以写一个nssring的category 给nsstring 增加一些方法,而这些方法就是一些正则表达式. 比如写一个叫做Helper的类  创建完了就是 NSString+Helper 然后在进行 ...

随机推荐

  1. Delphi XE2 生成的.exe 在未安装有Delphi的电脑上运行提示 “丢失 rtl160.bpl”

    解决方案: XE2中加入了多平台的概念,默认的Release模式,也是带包编译,带运行时库的,所以,需要手工设置一下工程选项: 打开工程以后,Project-->Options-->左侧树 ...

  2. Java 中的四种引用及垃圾回收策略

    Java 中有四种引用:强引用.软引用.弱引用.虚引用: 其主要区别在于垃圾回收时是否进行回收: 1.强引用 使用最普遍的引用.如果一个对象具有强引用,那就 类似于必不可少的生活用品,垃圾回收器绝不会 ...

  3. stl function扩展(一)

    #ifndef _FUNCTION_LIB_H_ #define _FUNCTION_LIB_H_ #include <functional> namespace function_lib ...

  4. 初识Selenium（一）

    Selenium入门相关PPT参考网址:http://wenku.baidu.com/view/d1e7d90390c69ec3d5bb7565.html?from=search 内容引用网址:htt ...

  5. hdu 1535 Invitation Cards(SPFA)

    Invitation Cards Time Limit : 10000/5000ms (Java/Other)   Memory Limit : 65536/65536K (Java/Other) T ...

  6. Python虚拟环境安装virtualenv

    解决了多个版本共存的问题 virtualenv 为每个不同项目提供一份 Python 安装.它并没有真正安装多个 Python 副本,但是它确实提供了一种巧妙的方式来让各项目环境保持独立. 安装vir ...

  7. 转：LoadRunner获取毫秒及字符串替换实现

    今天做一个性能测试,参数化要求创建用户名不可以重复,想来想不没有什么好的办法来避免用户名字的重复.所以就想用时间+随机数来实现,但是实现中遇到一个问题. 名字中不可以包含.这个特殊的字符的.所以要处理 ...

  8. Safari WebApp 模拟 原声APP禁止打开新窗口JS代码

    if(("standalone" in window.navigator) && window.navigator.standalone) { var noddy, ...

  9. eclipse快捷键（转载）

    Ctrl+1 快速修复(最经典的快捷键,就不用多说了)Ctrl+D: 删除当前行 Ctrl+Alt+↓ 复制当前行到下一行(复制增加)Ctrl+Alt+↑ 复制当前行到上一行(复制增加)Alt+↓ 当 ...

  10. wince天气代码

    #ifndef COMMON_H #define COMMON_H #include <Windows.h> typedef struct _operateInfo { HANDLE hS ...