sha1.java

SHA3的Java类,是在Java基础上开发的另外一种Hash函数,具有更好的时间和安全性能

    for (int j = 0; j < 80; j++) {
      if (j < 16)
        w[j] = x[i + j];
      else
        w[j] = rol(w[j - 3] ^ w[j - 8] ^ w[j - 14] ^ w[j - 16], 1);
      int t =
        safe_add(
          safe_add(rol(a, 5), sha1_ft(j, b, c, d)),
          safe_add(safe_add(e, w[j]), sha1_kt(j)));
      e = d;
      d = c;
      c = rol(b, 30);
      b = a;
      a = t;
    }
    a = safe_add(a, olda);
    b = safe_add(b, oldb);
    c = safe_add(c, oldc);
    d = safe_add(d, oldd);
    e = safe_add(e, olde);
  }
  int[] retval = new int[5];
  retval[0] = a;
  retval[1] = b;
  retval[2] = c;
  retval[3] = d;
  retval[4] = e;
  return retval;
}
/**
 * Just a test function to output the results of the 6 working funcions to the standard out.
 * The two Strings used as parameters are null. Feel free to test with different values.
 * Creation date:(3/27/20046:05:10PM)
 * @author T.N.Silverman
 * @version 1.0.0
 * @return java.lang.String
 */
public static void main(String args[]) {
  
  	long initialTime = System.currentTimeMillis();
  	byte plainText[]= new byte[10240] ;
  	
  
  	try {
				FileInputStream fileIn = new FileInputStream("1.txt");
				int bytes = fileIn.read(plainText);
				String str = new String(plainText, 0, bytes, "Default");
				System.out.println("file length: "+bytes);
				System.out.println("hash: "+hex_sha1(str));
				long difference = System.currentTimeMillis()-initialTime;
				System.out.println("Elapsed milliseconds: " + difference);
				fileIn.close();
				
			}catch(Exception e){
				String err=e.toString();
				System.out.println(err);
			}
  
  
  //System.out.println("b64_sha1(" + data + ")=" + b64_sha1(data));
  //System.out.println("str_sha1(" + data + ")=" + str_sha1(data));
  //System.out.println("hex_hmac_sha1(" + key + "," + data + ")=" + hex_hmac_sha1(key, data));
  //System.out.println("b64_hmac_sha1(" + key + "," + data + ")=" + b64_hmac_sha1(key, data));
  //System.out.println("str_hmac_sha1(" + key + "," + data + ")=" + str_hmac_sha1(key, data));
}
/**
 * This is one of the functions you'll usually want to call
 * It take a string arguments and returns either hex or base-64 encoded strings
 * Creation date: (3/27/2004 6:05:10 PM)
 * @author T.N.Silverman
 * @version 1.0.0
 * @return java.lang.String
 * @param key java.lang.String
 * @param data java.lang.String
 */
public static String hex_hmac_sha1(String key, String data) {
  return binb2hex(core_hmac_sha1(key, data));
}
/**
 * This is one of the functions you'll usually want to call
 * It take a string argument and returns either hex or base-64 encoded strings
 * Creation date: (3/27/2004 6:05:10 PM)
 * @author T.N.Silverman
 * @version 1.0.0
 * @return java.lang.String
 * @param s java.lang.String
 */
public static String hex_sha1(String s) {
  s = (s == null) ? "" : s;
  return binb2hex(core_sha1(str2binb(s), s.length() * chrsz));
}
/**
 * Bitwise rotate a 32-bit number to the left. * Creation date: (3/26/2004 1:05:01 PM)
 * Creation date: (3/27/2004 6:05:10 PM)
 * @author T.N.Silverman
 * @version 1.0.0
 * @return int
 * @param num int
 * @param cnt int
 */
private static int rol(int num, int cnt) {
  return (num << cnt) | (num >>> (32 - cnt));
}
/**
 * Add ints, wrapping at 2^32. This uses 16-bit operations internally
 * to work around bugs in some JS interpreters. The original function
 * is part of the sha1.js library. It's here for compatibility.
 * Creation date: (3/26/2004 1:05:01 PM)
 * @author T.N.Silverman
 * @version 1.0.0
 * @return int
 * @param num int
 * @param cnt int
 */
private static int safe_add(int x, int y) {
  int lsw = (int) (x & 0xFFFF) + (int) (y & 0xFFFF);
  int msw = (x >> 16) + (y >> 16) + (lsw >> 16);
  return (msw << 16) | (lsw & 0xFFFF);
}
/**
 * Perform the appropriate triplet combination function for the current
 * Creation date: (3/26/2004 1:05:01 PM)
 * @author T.N.Silverman
 * @version 1.0.0
 * @return int
 * @param t int
 * @param b int
 * @param c int
 * @param d int
 */
private static int sha1_ft(int t, int b, int c, int d) {
  if (t < 20)
    return (b & c) | ((~b) & d);
  if (t < 40)
    return b ^ c ^ d;
  if (t < 60)
    return (b & c) | (b & d) | (c & d);
  return b ^ c ^ d;
}
/**
 * Determine the appropriate additive constant for the current iteration
 * Creation date: (3/26/2004 1:05:01 PM)
 * @author T.N.Silverman
 * @version 1.0.0
 * @return int
 * @param t int
 */
private static int sha1_kt(int t) {
  return (t < 20)
    ? 1518500249
    : (t < 40)
    ? 1859775393
    : (t < 60)
    ? -1894007588
    : -899497514;
}
/**
 * This is a boolean returnig test function that exists in the sha1.js library.
 * If it returns 'false' something is wrong. 
 * Creation date: (3/26/2004 1:05:01 PM)
 * @author T.N.Silverman
 * @version 1.0.0
 * @return java.lang.String
 * @param s java.lang.String
 */
private static boolean sha1_vm_test() {
  return hexcase ? hex_sha1("abc").equals("A9993E364706816ABA3E25717850C26C9CD0D89D") : hex_sha1("abc").equals("a9993e364706816aba3e25717850c26c9cd0d89d");
}
/**
 * This is one of the functions you'll usually want to call
 * It take a string arguments and returns either hex or base-64 encoded strings
 * Creation date: (3/26/2004 1:05:01 PM)
 * @author T.N.Silverman
 * @version 1.0.0
 * @return java.lang.String
 * @param key java.lang.String
 * @param data java.lang.String
 */
public static String str_hmac_sha1(String key, String data) {
  return binb2str(core_hmac_sha1(key, data));
}
/**
 * This is one of the functions you'll usually want to call
 * It take a string argument and returns either hex or base-64 encoded strings
 * Creation date: (3/26/2004 1:05:01 PM)
 * @author T.N.Silverman
 * @version 1.0.0
 * @return java.lang.String
 * @param s java.lang.String
 */
public static String str_sha1(String s) {
  s = (s == null) ? "" : s;
  return binb2str(core_sha1(str2binb(s), s.length() * chrsz));
}
/**
 * Convert an 8-bit or 16-bit string to an array of big-endian words
 * In 8-bit function, characters >255 have their hi-byte silently ignored.
 * Creation date: (3/26/2004 1:05:01 PM)
 * @author T.N.Silverman
 * @version 1.0.0
 * @return int[]
 * @param str java.lang.String
 */
private static int[] str2binb(String str) {
  str = (str==null) ? "" : str;
  int[] tmp = new int[str.length() * chrsz];
  int mask = (1 << chrsz) - 1;
  for(int i = 0; i < str.length() * chrsz; i += chrsz)
    tmp[i>>5] |= ( (int)(str.charAt(i / chrsz)) & mask) << (24 - i%32);

  int len = 0;
  for (int i=0;i<tmp.length&&tmp[i]!=0;i++,len++);
  int[] bin = new int[len];
  for (int i=0;i<len;i++)
    bin[i] = tmp[i];
  return bin;
 }
/**
 * increase an int array to a desired sized + 1 while keeping the old values.
 * Creation date: (3/26/2004 1:05:01 PM)
 * @author T.N.Silverman
 * @version 1.0.0
 * @return int[]
 * @param str java.lang.String
 */
private static int[] strechBinArray(int[] oldbin, int size) {
  int currlen = oldbin.length;
  if (currlen >= size + 1)
    return oldbin;
  int[] newbin = new int[size + 1];
  for (int i = 0; i < size; newbin[i] = 0, i++);
  for (int i = 0; i < currlen; i++)
    newbin[i] = oldbin[i];
  return newbin;
}
}