前端实现MD5加密

本文介绍了如何在前端环境中实现MD5加密,针对JavaScript开发者,详细阐述了MD5加密的步骤和使用场景。
摘要由CSDN通过智能技术生成

前端实现MD5加密

/*
  * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
  * See http://pajhome.org.uk/site/legal.html for details.

* Add integers, wrapping at 2^32. This uses 16-bit operations internally
* to work around bugs in some JS interpreters.

  * 需要加密的文字或者数字作为必要参数传入: hexMD5.hexMD5(参数);
  (Text or Numbers that need to be encrypted are passed in as necessary parameters: hexMD5.hexMD5(params))
  * author: cxr
*/

/* 
  参考代码
 */
function safe_add(x, y) {
   

    var lsw = (x & 0xFFFF) + (y & 0xFFFF)

    var msw = (x >> 16) + (y >> 16) + (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))

}



/*
* These functions implement the four basic operations the algorithm uses.
*/

function cmn(q, a, b, x, s, t) {
   

    return safe_add(rol(safe_add(safe_add(a, q), safe_add(x, t)), s), b)

}

function ff(a, b, c, d, x, s, t) {
   

    return cmn((b & c) | ((~b) & d), a, b, x, s, t)

}

function gg(a, b, c, d, x, s, t) {
   

    return cmn((b & d) | (c & (~d)), a, b, x, s, t)

}

function hh(a, b, c, d, x, s, t) {
   

    return cmn(b ^ c ^ d, a, b, x, s, t)

}

function ii(a, b, c, d, x, s, t) {
   

    return cmn(c ^ (b | (~d)), a, b, x, s, t)

}



/*
* Calculate the MD5 of an array of little-endian words, producing an array
* of little-endian words.
*/

function coreMD5(x) {
   

    var a = 1732584193

    var b = -271733879

    var c = -1732584194

    var d = 271733878



    for (var i = 0; i < x.length; i += 16) {
   

        var olda = a

        var oldb = b

        var oldc = c

        var oldd = d



        a = ff(a, b, c, d, x[i + 0], 7, -680876936)

        d = ff(d, a, b, c, x[i + 1], 12, -389564586)

        c = ff(c, d, a, b, x[i + 2], 17, 606105819)

        b = ff(b, c, d, a, x[i + 3], 22, -1044525330)

        a = ff(a, b, c, d, x[i + 4], 7, -176418897)

        d = ff(d, a, b,
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值