g.java

经过反编译和部分代码修改后的ultraimpro java源代码。可在netbean环境下成功编译。供学习和分析用。

// Decompiled by DJ v3.9.9.91 Copyright 2005 Atanas Neshkov  Date: 2006-5-1 19:31:43
// Home Page : http://members.fortunecity.com/neshkov/dj.html  - Check often for new version!
// Decompiler options: packimports(3) 


public final class g
{

    public g()
    {
    }

    public final int[] a(String s)
    {
        boolean flag = false;
        int i;
        int j;
        int ai[] = new int[i = (((j = s.length()) * 8 + 64) / 512 + 1) * 16];
        for(int k = 0; k < j * 8; k += 8)
            ai[k >> 5] |= (s.charAt(k / 8) & 0xff) << k % 32;

        return ai;
    }

    public final void a(int ai[], int i)
    {
        ai[i >> 5] |= 128 << i % 32;
        ai[((i + 64 >>> 9) << 4) + 14] = i;
        int j1 = 0x67452301;
        int k1 = 0xefcdab89;
        int l1 = 0x98badcfe;
        int i2 = 0x10325476;
        for(int j2 = 0; j2 < ai.length; j2 += 16)
        {
            int j = j1;
            int k = k1;
            int l = l1;
            int i1 = i2;
            j1 = a(j1, k1, l1, i2, ai[j2 + 0], 7, 0xd76aa478);
            i2 = a(i2, j1, k1, l1, ai[j2 + 1], 12, 0xe8c7b756);
            l1 = a(l1, i2, j1, k1, ai[j2 + 2], 17, 0x242070db);
            k1 = a(k1, l1, i2, j1, ai[j2 + 3], 22, 0xc1bdceee);
            j1 = a(j1, k1, l1, i2, ai[j2 + 4], 7, 0xf57c0faf);
            i2 = a(i2, j1, k1, l1, ai[j2 + 5], 12, 0x4787c62a);
            l1 = a(l1, i2, j1, k1, ai[j2 + 6], 17, 0xa8304613);
            k1 = a(k1, l1, i2, j1, ai[j2 + 7], 22, 0xfd469501);
            j1 = a(j1, k1, l1, i2, ai[j2 + 8], 7, 0x698098d8);
            i2 = a(i2, j1, k1, l1, ai[j2 + 9], 12, 0x8b44f7af);
            l1 = a(l1, i2, j1, k1, ai[j2 + 10], 17, -42063);
            k1 = a(k1, l1, i2, j1, ai[j2 + 11], 22, 0x895cd7be);
            j1 = a(j1, k1, l1, i2, ai[j2 + 12], 7, 0x6b901122);
            i2 = a(i2, j1, k1, l1, ai[j2 + 13], 12, 0xfd987193);
            l1 = a(l1, i2, j1, k1, ai[j2 + 14], 17, 0xa679438e);
            k1 = a(k1, l1, i2, j1, ai[j2 + 15], 22, 0x49b40821);
            j1 = b(j1, k1, l1, i2, ai[j2 + 1], 5, 0xf61e2562);
            i2 = b(i2, j1, k1, l1, ai[j2 + 6], 9, 0xc040b340);
            l1 = b(l1, i2, j1, k1, ai[j2 + 11], 14, 0x265e5a51);
            k1 = b(k1, l1, i2, j1, ai[j2 + 0], 20, 0xe9b6c7aa);
            j1 = b(j1, k1, l1, i2, ai[j2 + 5], 5, 0xd62f105d);
            i2 = b(i2, j1, k1, l1, ai[j2 + 10], 9, 0x2441453);
            l1 = b(l1, i2, j1, k1, ai[j2 + 15], 14, 0xd8a1e681);
            k1 = b(k1, l1, i2, j1, ai[j2 + 4], 20, 0xe7d3fbc8);
            j1 = b(j1, k1, l1, i2, ai[j2 + 9], 5, 0x21e1cde6);
            i2 = b(i2, j1, k1, l1, ai[j2 + 14], 9, 0xc33707d6);
            l1 = b(l1, i2, j1, k1, ai[j2 + 3], 14, 0xf4d50d87);
            k1 = b(k1, l1, i2, j1, ai[j2 + 8], 20, 0x455a14ed);
            j1 = b(j1, k1, l1, i2, ai[j2 + 13], 5, 0xa9e3e905);
            i2 = b(i2, j1, k1, l1, ai[j2 + 2], 9, 0xfcefa3f8);
            l1 = b(l1, i2, j1, k1, ai[j2 + 7], 14, 0x676f02d9);
            k1 = b(k1, l1, i2, j1, ai[j2 + 12], 20, 0x8d2a4c8a);
            j1 = c(j1, k1, l1, i2, ai[j2 + 5], 4, 0xfffa3942);
            i2 = c(i2, j1, k1, l1, ai[j2 + 8], 11, 0x8771f681);
            l1 = c(l1, i2, j1, k1, ai[j2 + 11], 16, 0x6d9d6122);
            k1 = c(k1, l1, i2, j1, ai[j2 + 14], 23, 0xfde5380c);
            j1 = c(j1, k1, l1, i2, ai[j2 + 1], 4, 0xa4beea44);
            i2 = c(i2, j1, k1, l1, ai[j2 + 4], 11, 0x4bdecfa9);
            l1 = c(l1, i2, j1, k1, ai[j2 + 7], 16, 0xf6bb4b60);
            k1 = c(k1, l1, i2, j1, ai[j2 + 10], 23, 0xbebfbc70);
            j1 = c(j1, k1, l1, i2, ai[j2 + 13], 4, 0x289b7ec6);
            i2 = c(i2, j1, k1, l1, ai[j2 + 0], 11, 0xeaa127fa);
            l1 = c(l1, i2, j1, k1, ai[j2 + 3], 16, 0xd4ef3085);
            k1 = c(k1, l1, i2, j1, ai[j2 + 6], 23, 0x4881d05);
            j1 = c(j1, k1, l1, i2, ai[j2 + 9], 4, 0xd9d4d039);
            i2 = c(i2, j1, k1, l1, ai[j2 + 12], 11, 0xe6db99e5);
            l1 = c(l1, i2, j1, k1, ai[j2 + 15], 16, 0x1fa27cf8);
            k1 = c(k1, l1, i2, j1, ai[j2 + 2], 23, 0xc4ac5665);
            j1 = d(j1, k1, l1, i2, ai[j2 + 0], 6, 0xf4292244);
            i2 = d(i2, j1, k1, l1, ai[j2 + 7], 10, 0x432aff97);
            l1 = d(l1, i2, j1, k1, ai[j2 + 14], 15, 0xab9423a7);
            k1 = d(k1, l1, i2, j1, ai[j2 + 5], 21, 0xfc93a039);
            j1 = d(j1, k1, l1, i2, ai[j2 + 12], 6, 0x655b59c3);
            i2 = d(i2, j1, k1, l1, ai[j2 + 3], 10, 0x8f0ccc92);
            l1 = d(l1, i2, j1, k1, ai[j2 + 10], 15, 0xffeff47d);
            k1 = d(k1, l1, i2, j1, ai[j2 + 1], 21, 0x85845dd1);
            j1 = d(j1, k1, l1, i2, ai[j2 + 8], 6, 0x6fa87e4f);
            i2 = d(i2, j1, k1, l1, ai[j2 + 15], 10, 0xfe2ce6e0);
            l1 = d(l1, i2, j1, k1, ai[j2 + 6], 15, 0xa3014314);
            k1 = d(k1, l1, i2, j1, ai[j2 + 13], 21, 0x4e0811a1);
            j1 = d(j1, k1, l1, i2, ai[j2 + 4], 6, 0xf7537e82);
            i2 = d(i2, j1, k1, l1, ai[j2 + 11], 10, 0xbd3af235);
            l1 = d(l1, i2, j1, k1, ai[j2 + 2], 15, 0x2ad7d2bb);
            k1 = d(k1, l1, i2, j1, ai[j2 + 9], 21, 0xeb86d391);
            j1 = b(j1, j);
            k1 = b(k1, k);
            l1 = b(l1, l);
            i2 = b(i2, i1);
        }

        a = (new int[] {
            j1, k1, l1, i2
        });
    }

    public final int a(int i, int j)
    {
        return i << j | i >>> 32 - j;
    }

    public final int a(int i, int j, int k, int l, int i1, int j1)
    {
        return b(a(b(b(j, i), b(l, j1)), i1), k);
    }

    public final int a(int i, int j, int k, int l, int i1, int j1, int k1)
    {
        return a(j & k | ~j & l, i, j, i1, j1, k1);
    }

    public final int b(int i, int j, int k, int l, int i1, int j1, int k1)
    {
        return a(j & l | k & ~l, i, j, i1, j1, k1);
    }

    public final int c(int i, int j, int k, int l, int i1, int j1, int k1)
    {
        return a(j ^ k ^ l, i, j, i1, j1, k1);
    }

    public final int d(int i, int j, int k, int l, int i1, int j1, int k1)
    {
        return a(k ^ (j | ~l), i, j, i1, j1, k1);
    }

    public final int b(int i, int j)
    {
        int k = (i & 0xffff) + (j & 0xffff);
        int l;
        return (l = (i >> 16) + (j >> 16) + (k >> 16)) << 16 | k & 0xffff;
    }

    public final byte[] a()
    {
        byte abyte0[] = new byte[a.length * 4];
        for(int i = 0; i < abyte0.length; i++)
            abyte0[i] = (byte)(a[i >> 2] >> (i % 4) * 8 & 0xff);

        return abyte0;
    }

    public final String a_mod_tos(String s)
    {
        byte abyte0[];
        int i = (abyte0 = a_mod_tob(s)).length;
        StringBuffer stringbuffer = new StringBuffer(i * 2);
        for(int k = 0; k < i; k++)
        {
            int j;
            if((j = abyte0[k] & 0xff) < 16)
                stringbuffer.append('0');
            stringbuffer.append(Integer.toHexString(j));
        }

        String s1;
        return s1 = stringbuffer.toString().toLowerCase();
    }

    public final byte[] a_mod_tob(String s)
    {
        a(a(s), s.length() * 8);
        return a();
    }

    public int a[];
}