Java String Encrypt encrypt(String data, String key)

Here you can find the source of encrypt(String data, String key)

Description

encrypt

License

Apache License

Declaration

public static final byte[] encrypt(String data, String key) 

Method Source Code

//package com.java2s;
/*******************************************************************************
 * Copyright 2013 pyros2097//www . j a va2  s . c  om
 * 
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 * 
 *   http://www.apache.org/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 ******************************************************************************/

public class Main {
    private static final int delta = 0x9E3779B9;

    public static final byte[] encrypt(String data, String key) {
        return encrypt(data.getBytes(), key.getBytes());
    }

    public static final byte[] encrypt(byte[] data, byte[] key) {
        if (data.length == 0)
            return data;
        return toByteArray(encrypt(toIntArray(data, true), toIntArray(key, false)), false);
    }

    /**
    * Encrypt data with key.
    *
    * @param v
    * @param k
    * @return
    */
    private static final int[] encrypt(int[] v, int[] k) {
        int n = v.length - 1;
        if (n < 1) {
            return v;
        }
        if (k.length < 4) {
            int[] key = new int[4];

            System.arraycopy(k, 0, key, 0, k.length);
            k = key;
        }
        int z = v[n], y = v[0], sum = 0, e;
        int p, q = 6 + 52 / (n + 1);

        while (q-- > 0) {
            sum = sum + delta;
            e = sum >>> 2 & 3;
            for (p = 0; p < n; p++) {
                y = v[p + 1];
                z = v[p] += MX(sum, y, z, p, e, k);
            }
            y = v[0];
            z = v[n] += MX(sum, y, z, p, e, k);
        }
        return v;
    }

    /**
    * Convert int array to byte array.
    *
    * @param data
    * @param includeLength
    * @return
    */
    private static final byte[] toByteArray(int[] data, boolean includeLength) {
        int n = data.length << 2;

        if (includeLength) {
            int m = data[data.length - 1];

            if (m > n) {
                return null;
            } else {
                n = m;
            }
        }
        byte[] result = new byte[n];

        for (int i = 0; i < n; i++) {
            result[i] = (byte) ((data[i >>> 2] >>> ((i & 3) << 3)) & 0xff);
        }
        return result;
    }

    /**
    * Convert byte array to int array.
    *
    * @param data
    * @param includeLength
    * @return
    */
    private static final int[] toIntArray(byte[] data, boolean includeLength) {
        int n = (((data.length & 3) == 0) ? (data.length >>> 2) : ((data.length >>> 2) + 1));
        int[] result;

        if (includeLength) {
            result = new int[n + 1];
            result[n] = data.length;
        } else {
            result = new int[n];
        }
        n = data.length;
        for (int i = 0; i < n; i++) {
            result[i >>> 2] |= (0x000000ff & data[i]) << ((i & 3) << 3);
        }
        return result;
    }

    private static final int MX(int sum, int y, int z, int p, int e, int[] k) {
        return (z >>> 5 ^ y << 2) + (y >>> 3 ^ z << 4) ^ (sum ^ y) + (k[p & 3 ^ e] ^ z);
    }
}

Related

  1. encrypt(byte[] data)
  2. encrypt(byte[] plaintextBytes, int r, int n)
  3. encrypt(byte[] serialize)
  4. encrypt(char ch)
  5. encrypt(int original, int salt)
  6. encrypt(String inStr)
  7. encrypt(String s)
  8. encrypt(String s)
  9. encrypt(String str)