MD5加签(雪崩算法)

import java.io.UnsupportedEncodingException;
import java.security.MessageDigest;
import java.security.NoSuchAlgorithmException;

public class MD5 {

    public MD5() {
        md5Init();
        return;
    }


    static final int S11 = 7;

    static final int S12 = 12;

    static final int S13 = 17;

    static final int S14 = 22;

    static final int S21 = 5;

    static final int S22 = 9;

    static final int S23 = 14;

    static final int S24 = 20;

    static final int S31 = 4;

    static final int S32 = 11;

    static final int S33 = 16;

    static final int S34 = 23;

    static final int S41 = 6;

    static final int S42 = 10;

    static final int S43 = 15;

    static final int S44 = 21;

    static final byte[] PADDING = { -128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
            0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
            0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
            0, 0, 0, 0, 0, 0, 0 };

    private long[] state = new long[4]; // state (ABCD)

    private long[] count = new long[2]; // number of bits, modulo 2^64 (lsb

    // first

    private byte[] buffer = new byte[64]; // input buffer


    private byte[] digest = new byte[16];


    public String getMD5ofStr(String inbuf) {
        md5Init();
        try {
            byte abyte1[] = inbuf.getBytes("UTF-8");
            md5Update(abyte1, abyte1.length);
        } catch (UnsupportedEncodingException e) {
            throw new RuntimeException(e.getMessage(), e);
        }
        md5Final();
        String digestHexStr = "";
        for (int i = 0; i < 16; i++) {
            digestHexStr += byteHEX(digest[i]);
        }
        return digestHexStr;

    }

    public byte[] getKeyedDigest(byte[] buffer, byte[] key) {
        try {
            MessageDigest md5 = MessageDigest.getInstance("MD5");
            md5.update(buffer);
            return md5.digest(key);
        } catch (NoSuchAlgorithmException e) {
            e.printStackTrace();
        }
        return null;
    }

    public String decode(String str) {
        try {
            return java.net.URLDecoder.decode(str, "UTF-8");
        } catch (UnsupportedEncodingException e) {
            e.printStackTrace();
        }
        return null;
    }

    public String getKeyedDigest(String strSrc, String key) {
        try {
            MessageDigest md5 = MessageDigest.getInstance("MD5");
            md5.update(strSrc.getBytes("UTF8"));
            String result = "";
            byte[] temp;
            temp = md5.digest(key.getBytes("UTF8"));
            for (int i = 0; i < temp.length; i++) {
                result += Integer.toHexString(
                        (0x000000ff & temp[i]) | 0xffffff00).substring(6);
            }

            return result;

        } catch (NoSuchAlgorithmException e) {
            e.printStackTrace();
        } catch (Exception e) {
            e.printStackTrace();
        }
        return null;
    }

    public String getMD5ofStr(byte[] abyte1) {
        md5Init();
        md5Update(abyte1, abyte1.length);
        md5Final();
        String digestHexStr = "";
        for (int i = 0; i < 16; i++) {
            digestHexStr += byteHEX(digest[i]);
        }
        return digestHexStr;

    }


    private void md5Init() {
        count[0] = 0L;
        count[1] = 0L;
        state[0] = 0x67452301L;
        state[1] = 0xefcdab89L;
        state[2] = 0x98badcfeL;
        state[3] = 0x10325476L;

        return;
    }


    private long f(long x, long y, long z) {
        return (x & y) | ((~x) & z);

    }

    private long g(long x, long y, long z) {
        return (x & z) | (y & (~z));

    }

    private long h(long x, long y, long z) {
        return x ^ y ^ z;
    }

    private long i(long x, long y, long z) {
        return y ^ (x | (~z));
    }


    private long ff(long a, long b, long c, long d, long x, long s, long ac) {
        a += f(b, c, d) + x + ac;
        a = ((int) a << s) | ((int) a >>> (32 - s));
        a += b;
        return a;
    }

    private long gg(long a, long b, long c, long d, long x, long s, long ac) {
        a += g(b, c, d) + x + ac;
        a = ((int) a << s) | ((int) a >>> (32 - s));
        a += b;
        return a;
    }

    private long hh(long a, long b, long c, long d, long x, long s, long ac) {
        a += h(b, c, d) + x + ac;
        a = ((int) a << s) | ((int) a >>> (32 - s));
        a += b;
        return a;
    }

    private long ii(long a, long b, long c, long d, long x, long s, long ac) {
        a += i(b, c, d) + x + ac;
        a = ((int) a << s) | ((int) a >>> (32 - s));
        a += b;
        return a;
    }


    private void md5Update(byte[] inbuf, int inputLen) {

        int i, index, partLen;
        byte[] block = new byte[64];
        index = (int) (count[0] >>> 3) & 0x3F;
        // /* Update number of bits */
        if ((count[0] += (inputLen << 3)) < (inputLen << 3)) {
            count[1]++;
        }
        count[1] += (inputLen >>> 29);

        partLen = 64 - index;

        // Transform as many times as possible.
        if (inputLen >= partLen) {
            md5Memcpy(buffer, inbuf, index, 0, partLen);
            md5Transform(buffer);

            for (i = partLen; i + 63 < inputLen; i += 64) {

                md5Memcpy(block, inbuf, 0, i, 64);
                md5Transform(block);
            }
            index = 0;

        } else {

            i = 0;

            // /* Buffer remaining input */
        }
        md5Memcpy(buffer, inbuf, index, i, inputLen - i);

    }

    private void md5Final() {
        byte[] bits = new byte[8];
        int index, padLen;

        // /* Save number of bits */
        encode(bits, count, 8);

        // /* Pad out to 56 mod 64.
        index = (int) (count[0] >>> 3) & 0x3f;
        padLen = (index < 56) ? (56 - index) : (120 - index);
        md5Update(PADDING, padLen);

        // /* Append length (before padding) */
        md5Update(bits, 8);

        // /* Store state in digest */
        encode(digest, state, 16);

    }



    private void md5Memcpy(byte[] output, byte[] input, int outpos, int inpos,
            int len) {
        int i;

        for (i = 0; i < len; i++) {
            output[outpos + i] = input[inpos + i];
        }
    }


    private void md5Transform(byte block[]) {
        long a = state[0], b = state[1], c = state[2], d = state[3];
        long[] x = new long[16];

        decode(x, block, 64);

        /* Round 1 */
        a = ff(a, b, c, d, x[0], S11, 0xd76aa478L); /* 1 */
        d = ff(d, a, b, c, x[1], S12, 0xe8c7b756L); /* 2 */
        c = ff(c, d, a, b, x[2], S13, 0x242070dbL); /* 3 */
        b = ff(b, c, d, a, x[3], S14, 0xc1bdceeeL); /* 4 */
        a = ff(a, b, c, d, x[4], S11, 0xf57c0fafL); /* 5 */
        d = ff(d, a, b, c, x[5], S12, 0x4787c62aL); /* 6 */
        c = ff(c, d, a, b, x[6], S13, 0xa8304613L); /* 7 */
        b = ff(b, c, d, a, x[7], S14, 0xfd469501L); /* 8 */
        a = ff(a, b, c, d, x[8], S11, 0x698098d8L); /* 9 */
        d = ff(d, a, b, c, x[9], S12, 0x8b44f7afL); /* 10 */
        c = ff(c, d, a, b, x[10], S13, 0xffff5bb1L); /* 11 */
        b = ff(b, c, d, a, x[11], S14, 0x895cd7beL); /* 12 */
        a = ff(a, b, c, d, x[12], S11, 0x6b901122L); /* 13 */
        d = ff(d, a, b, c, x[13], S12, 0xfd987193L); /* 14 */
        c = ff(c, d, a, b, x[14], S13, 0xa679438eL); /* 15 */
        b = ff(b, c, d, a, x[15], S14, 0x49b40821L); /* 16 */

        /* Round 2 */
        a = gg(a, b, c, d, x[1], S21, 0xf61e2562L); /* 17 */
        d = gg(d, a, b, c, x[6], S22, 0xc040b340L); /* 18 */
        c = gg(c, d, a, b, x[11], S23, 0x265e5a51L); /* 19 */
        b = gg(b, c, d, a, x[0], S24, 0xe9b6c7aaL); /* 20 */
        a = gg(a, b, c, d, x[5], S21, 0xd62f105dL); /* 21 */
        d = gg(d, a, b, c, x[10], S22, 0x2441453L); /* 22 */
        c = gg(c, d, a, b, x[15], S23, 0xd8a1e681L); /* 23 */
        b = gg(b, c, d, a, x[4], S24, 0xe7d3fbc8L); /* 24 */
        a = gg(a, b, c, d, x[9], S21, 0x21e1cde6L); /* 25 */
        d = gg(d, a, b, c, x[14], S22, 0xc33707d6L); /* 26 */
        c = gg(c, d, a, b, x[3], S23, 0xf4d50d87L); /* 27 */
        b = gg(b, c, d, a, x[8], S24, 0x455a14edL); /* 28 */
        a = gg(a, b, c, d, x[13], S21, 0xa9e3e905L); /* 29 */
        d = gg(d, a, b, c, x[2], S22, 0xfcefa3f8L); /* 30 */
        c = gg(c, d, a, b, x[7], S23, 0x676f02d9L); /* 31 */
        b = gg(b, c, d, a, x[12], S24, 0x8d2a4c8aL); /* 32 */

        /* Round 3 */
        a = hh(a, b, c, d, x[5], S31, 0xfffa3942L); /* 33 */
        d = hh(d, a, b, c, x[8], S32, 0x8771f681L); /* 34 */
        c = hh(c, d, a, b, x[11], S33, 0x6d9d6122L); /* 35 */
        b = hh(b, c, d, a, x[14], S34, 0xfde5380cL); /* 36 */
        a = hh(a, b, c, d, x[1], S31, 0xa4beea44L); /* 37 */
        d = hh(d, a, b, c, x[4], S32, 0x4bdecfa9L); /* 38 */
        c = hh(c, d, a, b, x[7], S33, 0xf6bb4b60L); /* 39 */
        b = hh(b, c, d, a, x[10], S34, 0xbebfbc70L); /* 40 */
        a = hh(a, b, c, d, x[13], S31, 0x289b7ec6L); /* 41 */
        d = hh(d, a, b, c, x[0], S32, 0xeaa127faL); /* 42 */
        c = hh(c, d, a, b, x[3], S33, 0xd4ef3085L); /* 43 */
        b = hh(b, c, d, a, x[6], S34, 0x4881d05L); /* 44 */
        a = hh(a, b, c, d, x[9], S31, 0xd9d4d039L); /* 45 */
        d = hh(d, a, b, c, x[12], S32, 0xe6db99e5L); /* 46 */
        c = hh(c, d, a, b, x[15], S33, 0x1fa27cf8L); /* 47 */
        b = hh(b, c, d, a, x[2], S34, 0xc4ac5665L); /* 48 */

        /* Round 4 */
        a = ii(a, b, c, d, x[0], S41, 0xf4292244L); /* 49 */
        d = ii(d, a, b, c, x[7], S42, 0x432aff97L); /* 50 */
        c = ii(c, d, a, b, x[14], S43, 0xab9423a7L); /* 51 */
        b = ii(b, c, d, a, x[5], S44, 0xfc93a039L); /* 52 */
        a = ii(a, b, c, d, x[12], S41, 0x655b59c3L); /* 53 */
        d = ii(d, a, b, c, x[3], S42, 0x8f0ccc92L); /* 54 */
        c = ii(c, d, a, b, x[10], S43, 0xffeff47dL); /* 55 */
        b = ii(b, c, d, a, x[1], S44, 0x85845dd1L); /* 56 */
        a = ii(a, b, c, d, x[8], S41, 0x6fa87e4fL); /* 57 */
        d = ii(d, a, b, c, x[15], S42, 0xfe2ce6e0L); /* 58 */
        c = ii(c, d, a, b, x[6], S43, 0xa3014314L); /* 59 */
        b = ii(b, c, d, a, x[13], S44, 0x4e0811a1L); /* 60 */
        a = ii(a, b, c, d, x[4], S41, 0xf7537e82L); /* 61 */
        d = ii(d, a, b, c, x[11], S42, 0xbd3af235L); /* 62 */
        c = ii(c, d, a, b, x[2], S43, 0x2ad7d2bbL); /* 63 */
        b = ii(b, c, d, a, x[9], S44, 0xeb86d391L); /* 64 */

        state[0] += a;
        state[1] += b;
        state[2] += c;
        state[3] += d;

    }


    private void encode(byte[] output, long[] input, int len) {
        int i, j;

        for (i = 0, j = 0; j < len; i++, j += 4) {
            output[j] = (byte) (input[i] & 0xffL);
            output[j + 1] = (byte) ((input[i] >>> 8) & 0xffL);
            output[j + 2] = (byte) ((input[i] >>> 16) & 0xffL);
            output[j + 3] = (byte) ((input[i] >>> 24) & 0xffL);
        }
    }


    private void decode(long[] output, byte[] input, int len) {
        int i, j;

        for (i = 0, j = 0; j < len; i++, j += 4) {
            output[i] = b2iu(input[j]) | (b2iu(input[j + 1]) << 8)
                    | (b2iu(input[j + 2]) << 16) | (b2iu(input[j + 3]) << 24);
        }

        return;
    }

    /**
     * 鎶奲yte鎸夌収涓嶈�铏戞璐熷彿鐨勫師鍒欑殑锛傚崌浣嶏紓绋嬪簭锛屽洜涓簀ava娌℃湁unsigned杩愮畻
     */
    private static long b2iu(byte b) {
        return b < 0 ? b & 0x7F + 128 : b;
    }

    /**
     * byteHEX()锛岀敤鏉ユ妸涓�釜byte绫诲瀷鐨勬暟杞崲鎴愬崄鍏繘鍒剁殑ASCII琛ㄧず锛宩ava涓殑byte鐨則oString鏃犳硶瀹炵幇杩欎竴鐐�
     */
    private static String byteHEX(byte ib) {
        char[] digit = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A',
                'B', 'C', 'D', 'E', 'F' };
        char[] ob = new char[2];
        ob[0] = digit[(ib >>> 4) & 0X0F];
        ob[1] = digit[ib & 0X0F];
        return new String(ob);
    }

    public static void main(String[] args) {
        MD5 md5 = new MD5();
        int integer = (int) 50.00 / 50;
        double remainder = ((double) (50 % 50)) / 50;
        String cardNum = "";
        if (remainder < 0.0001) {
            cardNum = integer + "";
        } else {
            cardNum = (integer + remainder) + "";
        }
    }
}

 

转载于:https://www.cnblogs.com/blakflash000/p/9406917.html

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值