All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.fasteasytrade.jrandtest.algo.MicaliSchnorr Maven / Gradle / Ivy

The newest version!
/*
 * Created on 31/03/2005
 *
 * JRandTest package
 *
 * Copyright (c) 2005, Zur Aougav, [email protected]
 * All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without modification, 
 * are permitted provided that the following conditions are met:
 * 
 * Redistributions of source code must retain the above copyright notice, this list 
 * of conditions and the following disclaimer. 
 * 
 * Redistributions in binary form must reproduce the above copyright notice, this 
 * list of conditions and the following disclaimer in the documentation and/or 
 * other materials provided with the distribution. 
 * 
 * Neither the name of the JRandTest nor the names of its contributors may be 
 * used to endorse or promote products derived from this software without specific 
 * prior written permission. 
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND 
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED 
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 
 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR 
 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON 
 * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
package com.fasteasytrade.jrandtest.algo;

import com.fasteasytrade.jrandtest.io.FileAlgoRandomStream;

/**
 * Micali-Schnorr algorithm as a random stream.
 * 

* Use MicaliSchnorrPrng class. *

* Implements algorithm directly from public published book. *

* The following program implements and tests the Micali-Schnorr random bits * generator. The test suite is according to FIPS 140-1. See "Handbook of * Applied Cryptography" by Alfred J. Menezes et al Section 5.4.4 pages 181 - * 183 and 5.37 Algorithm page 186. * * @author Zur Aougav */ public class MicaliSchnorr extends FileAlgoRandomStream { MicaliSchnorrPrng algo = null; byte[] outAlgoBuffer = new byte[8]; int outAlgoBufferIx = outAlgoBuffer.length; public MicaliSchnorr() { super(); } public MicaliSchnorr(String keyFileName) { super(keyFileName); } @Override public void setupKeys() { super.setupKeys(); } @Override public void setup() { /* * construct MicalisSchnorrPrng only once! */ if (algo == null) { algo = new MicaliSchnorrPrng(); outAlgoBuffer = new byte[algo.getK() / 8]; outAlgoBufferIx = outAlgoBuffer.length; } else { algo.reset(); // restore x to x0 } } @Override public boolean openInputStream() { if (filename != null) { super.openInputStream(); } setup(); // make sure algorithm and keys/states are reset count = 0; countLastRead = SIZE; actualSize = SIZE; outAlgoBufferIx = outAlgoBuffer.length; open = true; return open; } @Override public byte readByte() { if (!isOpen()) { return -1; } if (filename == null && count > maxCount) { open = false; return -1; } if (outAlgoBufferIx == outAlgoBuffer.length) { algo.getNextBits(outAlgoBuffer); outAlgoBufferIx = 0; } byte prng = outAlgoBuffer[outAlgoBufferIx++]; if (filename == null) { count++; return prng; } /* * we have a real filename to encrypt */ byte data = super.readByte(); return (byte)(prng ^ data); } @Override public int readInt() { if (!isOpen()) { return -1; } if (filename == null && count > maxCount) { open = false; return -1; } int prng = 0xff & readByte(); prng = (prng << 8) | (0xff & readByte()); prng = (prng << 8) | (0xff & readByte()); prng = (prng << 8) | (0xff & readByte()); return prng; } @Override public long readLong() { if (!isOpen()) { return -1; } if (filename == null && count > maxCount) { open = false; return -1; } long prng = 0xff & readByte(); for (int i = 0; i < 7; i++) { prng = (prng << 8) | (0xff & readByte()); } return prng; } public static void main(String[] args) { if (args != null && args.length > 0 && args[0] != null) { MicaliSchnorr algo = new MicaliSchnorr(); algo.setup(); try { algo.openInputStream(); for (int i = 0; i < 100; i++) { System.out.print(algo.readByte()); System.out.print(","); } System.out.println(); } catch (Exception e) { System.out.println("" + e); } } } }





© 2015 - 2025 Weber Informatics LLC | Privacy Policy