Hash.java

/*
 * Copyright (C) 2012 Red Hat, Inc. and/or its affiliates.
 *
 * 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.
 */

package org.jboss.websockets.oio.internal.util;

import java.security.MessageDigest;
import java.security.NoSuchAlgorithmException;
import java.security.SecureRandom;

/**
 * @author Mike Brock
 */
public final class Hash {
  private Hash() {
  }

  final static String secureRandomAlgorithm = "SHA1PRNG";
  final static String hashAlgorithm = "SHA1";
  final static SecureRandom random;
  final static byte[] seed;

  // don't bother using volatile. a thread race doesn't matter.
  private static int hashCounter = 0;

  static {
    try {
      random = SecureRandom.getInstance(secureRandomAlgorithm);
      random.setSeed(SecureRandom.getInstance(secureRandomAlgorithm).generateSeed(64));
      hashCounter = random.nextInt();
      random.nextBytes(seed = new byte[512]);
    }
    catch (final NoSuchAlgorithmException e) {
      throw new RuntimeException("runtime does not support secure random algorithm: " + secureRandomAlgorithm);
    }
  }

  public static byte[] getRandomBytes(final byte[] bytes) {
    if (hashCounter < 0) {
      hashCounter = 0;
    }
    for (int i = 0; i < bytes.length; i++) {
      hashCounter++;
      bytes[i] = (byte) (seed[(i + hashCounter) % seed.length] % Byte.MAX_VALUE);

      if (hashCounter % 1000 > 500) {
        // sign the byte.
        bytes[i] = (byte) -bytes[i];
      }

      if (hashCounter % 500 == 0) {
        // every 500 hashes or so, get some new entropy, and don't worry about thread races here.
        random.nextBytes(seed);
      }
    }
    return bytes;
  }

  public static String newUniqueHash() {
    return nextSecureHash(hashAlgorithm, getRandomBytes(new byte[64]));
  }

  private static String nextSecureHash(final String algorithm, final byte[] additionalSeed) {
    try {
      final MessageDigest md = MessageDigest.getInstance(algorithm);

      md.update(String.valueOf(System.nanoTime()).getBytes());

      if (additionalSeed != null) {
        md.update(additionalSeed);
      }

      final byte[] randBytes = new byte[32];
      getRandomBytes(randBytes);

      // 1,000 rounds.
      for (int i = 0; i < 1000; i++) {
        md.update(md.digest());
      }

      return hashToHexString(md.digest());
    }
    catch (final Exception e) {
      throw new RuntimeException("failed to generate session id hash", e);
    }
  }

  public static String hashToHexString(byte[] hash) {
    final StringBuilder hexString = new StringBuilder(hash.length);
    for (final byte mdbyte : hash) {
      hexString.append(Integer.toHexString(0xFF & mdbyte));
    }
    return hexString.toString();
  }
}