package gnu.crypto.util;
// ----------------------------------------------------------------------------
// $Id: PRNG.java,v 1.5 2005/10/06 04:24:18 rsdio Exp $
//
// Copyright (C) 2001, 2002, 2003 Free Software Foundation, Inc.
//
// This file is part of GNU Crypto.
//
// GNU Crypto is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2, or (at your option)
// any later version.
//
// GNU Crypto is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; see the file COPYING. If not, write to the
//
// Free Software Foundation Inc.,
// 51 Franklin Street, Fifth Floor,
// Boston, MA 02110-1301
// USA
//
// Linking this library statically or dynamically with other modules is
// making a combined work based on this library. Thus, the terms and
// conditions of the GNU General Public License cover the whole
// combination.
//
// As a special exception, the copyright holders of this library give
// you permission to link this library with independent modules to
// produce an executable, regardless of the license terms of these
// independent modules, and to copy and distribute the resulting
// executable under terms of your choice, provided that you also meet,
// for each linked independent module, the terms and conditions of the
// license of that module. An independent module is a module which is
// not derived from or based on this library. If you modify this
// library, you may extend this exception to your version of the
// library, but you are not obligated to do so. If you do not wish to
// do so, delete this exception statement from your version.
// ----------------------------------------------------------------------------
import gnu.crypto.Properties;
import gnu.crypto.prng.CSPRNG;
import gnu.crypto.prng.IRandom;
import gnu.crypto.prng.LimitReachedException;
import gnu.crypto.prng.MDGenerator;
import java.util.HashMap;
/**
* <p>A useful Singleton hash-based (SHA) pseudo-random number generator used
* throughout this library.</p>
*
* @version $Revision: 1.5 $
* @see gnu.crypto.prng.MDGenerator
*/
public class PRNG {
// Constants and variables
// -------------------------------------------------------------------------
/** SHA-based singleton random number generator. */
private static final IRandom singleton;
static {
try {
if (Properties.isReproducible()) { // Use unseeded SHA1PRNG
singleton = new MDGenerator();
} else { // use CSPRNG
singleton = CSPRNG.getSystemInstance();
}
} catch (Exception x) {
throw new ExceptionInInitializerError(x);
}
}
// Constructor(s)
// -------------------------------------------------------------------------
/** Trivial constructor to enforce Singleton pattern. */
private PRNG() {
super();
}
// Class methods
// -------------------------------------------------------------------------
/**
* <p>Completely fills the designated <code>buffer</code> with random data
* generated by the underlying singleton.</p>
*
* @param buffer the place holder of random bytes generated by this PRNG
* singleton. On output, the contents of <code>buffer</code> are replaced
* with pseudo-random data, iff the <code>buffer</code> size is not zero.
*/
public static void nextBytes(byte[] buffer) {
nextBytes(buffer, 0, buffer.length);
}
/**
* <p>Fills the designated <code>buffer</code>, starting from byte at
* position <code>offset</code> with, at most, <code>length</code> bytes of
* random data generated by the underlying singleton.</p>
*
* @see gnu.crypto.prng.IRandom#nextBytes
*/
public static void nextBytes(byte[] buffer, int offset, int length) {
try {
singleton.nextBytes(buffer, offset, length);
} catch (LimitReachedException x) { // re-initialise
try {
HashMap map = new HashMap();
if (!Properties.isReproducible()) { // initialise it with a seed
long t = System.currentTimeMillis();
byte[] seed = new byte[] {
(byte)(t >>> 56), (byte)(t >>> 48),
(byte)(t >>> 40), (byte)(t >>> 32),
(byte)(t >>> 24), (byte)(t >>> 16),
(byte)(t >>> 8), (byte) t
};
map.put(MDGenerator.SEEED, seed);
}
singleton.init(map); // default is to use SHA-1 hash
singleton.nextBytes(buffer, offset, length);
} catch (Exception y) {
throw new ExceptionInInitializerError(y);
}
}
}
}