Initial Commit
This commit is contained in:
61
iTechSharp/srcbc/crypto/prng/CryptoApiRandomGenerator.cs
Normal file
61
iTechSharp/srcbc/crypto/prng/CryptoApiRandomGenerator.cs
Normal file
@@ -0,0 +1,61 @@
|
||||
#if !NETCF_1_0
|
||||
|
||||
using System;
|
||||
using System.Security.Cryptography;
|
||||
|
||||
namespace Org.BouncyCastle.Crypto.Prng
|
||||
{
|
||||
/// <summary>
|
||||
/// Uses Microsoft's RNGCryptoServiceProvider
|
||||
/// </summary>
|
||||
public class CryptoApiRandomGenerator
|
||||
: IRandomGenerator
|
||||
{
|
||||
private readonly RNGCryptoServiceProvider rndProv;
|
||||
|
||||
public CryptoApiRandomGenerator()
|
||||
{
|
||||
rndProv = new RNGCryptoServiceProvider();
|
||||
}
|
||||
|
||||
#region IRandomGenerator Members
|
||||
|
||||
public virtual void AddSeedMaterial(byte[] seed)
|
||||
{
|
||||
// We don't care about the seed
|
||||
}
|
||||
|
||||
public virtual void AddSeedMaterial(long seed)
|
||||
{
|
||||
// We don't care about the seed
|
||||
}
|
||||
|
||||
public virtual void NextBytes(byte[] bytes)
|
||||
{
|
||||
rndProv.GetBytes(bytes);
|
||||
}
|
||||
|
||||
public virtual void NextBytes(byte[] bytes, int start, int len)
|
||||
{
|
||||
if (start < 0)
|
||||
throw new ArgumentException("Start offset cannot be negative", "start");
|
||||
if (bytes.Length < (start + len))
|
||||
throw new ArgumentException("Byte array too small for requested offset and length");
|
||||
|
||||
if (bytes.Length == len && start == 0)
|
||||
{
|
||||
NextBytes(bytes);
|
||||
}
|
||||
else
|
||||
{
|
||||
byte[] tmpBuf = new byte[len];
|
||||
rndProv.GetBytes(tmpBuf);
|
||||
Array.Copy(tmpBuf, 0, bytes, start, len);
|
||||
}
|
||||
}
|
||||
|
||||
#endregion
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
107
iTechSharp/srcbc/crypto/prng/DigestRandomGenerator.cs
Normal file
107
iTechSharp/srcbc/crypto/prng/DigestRandomGenerator.cs
Normal file
@@ -0,0 +1,107 @@
|
||||
using System;
|
||||
|
||||
using Org.BouncyCastle.Crypto.Digests;
|
||||
|
||||
namespace Org.BouncyCastle.Crypto.Prng
|
||||
{
|
||||
/**
|
||||
* Random generation based on the digest with counter. Calling addSeedMaterial will
|
||||
* always increase the entropy of the hash.
|
||||
* <p>
|
||||
* Internal access to the digest is syncrhonized so a single one of these can be shared.
|
||||
* </p>
|
||||
*/
|
||||
public class DigestRandomGenerator
|
||||
: IRandomGenerator
|
||||
{
|
||||
private long counter;
|
||||
private IDigest digest;
|
||||
private byte[] state;
|
||||
|
||||
public DigestRandomGenerator(
|
||||
IDigest digest)
|
||||
{
|
||||
this.digest = digest;
|
||||
this.state = new byte[digest.GetDigestSize()];
|
||||
this.counter = 1;
|
||||
}
|
||||
|
||||
public void AddSeedMaterial(
|
||||
byte[] inSeed)
|
||||
{
|
||||
lock (this)
|
||||
{
|
||||
DigestUpdate(inSeed);
|
||||
}
|
||||
}
|
||||
|
||||
public void AddSeedMaterial(
|
||||
long rSeed)
|
||||
{
|
||||
lock (this)
|
||||
{
|
||||
for (int i = 0; i != 8; i++)
|
||||
{
|
||||
DigestUpdate((byte)rSeed);
|
||||
// rSeed >>>= 8;
|
||||
rSeed >>= 8;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
public void NextBytes(
|
||||
byte[] bytes)
|
||||
{
|
||||
NextBytes(bytes, 0, bytes.Length);
|
||||
}
|
||||
|
||||
public void NextBytes(
|
||||
byte[] bytes,
|
||||
int start,
|
||||
int len)
|
||||
{
|
||||
lock (this)
|
||||
{
|
||||
int stateOff = 0;
|
||||
|
||||
DigestDoFinal(state);
|
||||
|
||||
int end = start + len;
|
||||
for (int i = start; i < end; ++i)
|
||||
{
|
||||
if (stateOff == state.Length)
|
||||
{
|
||||
DigestUpdate(counter++);
|
||||
DigestUpdate(state);
|
||||
DigestDoFinal(state);
|
||||
stateOff = 0;
|
||||
}
|
||||
bytes[i] = state[stateOff++];
|
||||
}
|
||||
|
||||
DigestUpdate(counter++);
|
||||
DigestUpdate(state);
|
||||
}
|
||||
}
|
||||
|
||||
private void DigestUpdate(long seed)
|
||||
{
|
||||
for (int i = 0; i != 8; i++)
|
||||
{
|
||||
digest.Update((byte)seed);
|
||||
// seed >>>= 8;
|
||||
seed >>= 8;
|
||||
}
|
||||
}
|
||||
|
||||
private void DigestUpdate(byte[] inSeed)
|
||||
{
|
||||
digest.BlockUpdate(inSeed, 0, inSeed.Length);
|
||||
}
|
||||
|
||||
private void DigestDoFinal(byte[] result)
|
||||
{
|
||||
digest.DoFinal(result, 0);
|
||||
}
|
||||
}
|
||||
}
|
26
iTechSharp/srcbc/crypto/prng/IRandomGenerator.cs
Normal file
26
iTechSharp/srcbc/crypto/prng/IRandomGenerator.cs
Normal file
@@ -0,0 +1,26 @@
|
||||
using System;
|
||||
|
||||
namespace Org.BouncyCastle.Crypto.Prng
|
||||
{
|
||||
/// <remarks>Generic interface for objects generating random bytes.</remarks>
|
||||
public interface IRandomGenerator
|
||||
{
|
||||
/// <summary>Add more seed material to the generator.</summary>
|
||||
/// <param name="seed">A byte array to be mixed into the generator's state.</param>
|
||||
void AddSeedMaterial(byte[] seed);
|
||||
|
||||
/// <summary>Add more seed material to the generator.</summary>
|
||||
/// <param name="seed">A long value to be mixed into the generator's state.</param>
|
||||
void AddSeedMaterial(long seed);
|
||||
|
||||
/// <summary>Fill byte array with random values.</summary>
|
||||
/// <param name="bytes">Array to be filled.</param>
|
||||
void NextBytes(byte[] bytes);
|
||||
|
||||
/// <summary>Fill byte array with random values.</summary>
|
||||
/// <param name="bytes">Array to receive bytes.</param>
|
||||
/// <param name="start">Index to start filling at.</param>
|
||||
/// <param name="len">Length of segment to fill.</param>
|
||||
void NextBytes(byte[] bytes, int start, int len);
|
||||
}
|
||||
}
|
98
iTechSharp/srcbc/crypto/prng/ReversedWindowGenerator.cs
Normal file
98
iTechSharp/srcbc/crypto/prng/ReversedWindowGenerator.cs
Normal file
@@ -0,0 +1,98 @@
|
||||
using System;
|
||||
|
||||
namespace Org.BouncyCastle.Crypto.Prng
|
||||
{
|
||||
/// <remarks>
|
||||
/// Takes bytes generated by an underling RandomGenerator and reverses the order in
|
||||
/// each small window (of configurable size).
|
||||
/// <p>
|
||||
/// Access to internals is synchronized so a single one of these can be shared.
|
||||
/// </p>
|
||||
/// </remarks>
|
||||
public class ReversedWindowGenerator
|
||||
: IRandomGenerator
|
||||
{
|
||||
private readonly IRandomGenerator generator;
|
||||
|
||||
private byte[] window;
|
||||
private int windowCount;
|
||||
|
||||
public ReversedWindowGenerator(
|
||||
IRandomGenerator generator,
|
||||
int windowSize)
|
||||
{
|
||||
if (generator == null)
|
||||
throw new ArgumentNullException("generator");
|
||||
if (windowSize < 2)
|
||||
throw new ArgumentException("Window size must be at least 2", "windowSize");
|
||||
|
||||
this.generator = generator;
|
||||
this.window = new byte[windowSize];
|
||||
}
|
||||
|
||||
/// <summary>Add more seed material to the generator.</summary>
|
||||
/// <param name="seed">A byte array to be mixed into the generator's state.</param>
|
||||
public virtual void AddSeedMaterial(
|
||||
byte[] seed)
|
||||
{
|
||||
lock (this)
|
||||
{
|
||||
windowCount = 0;
|
||||
generator.AddSeedMaterial(seed);
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>Add more seed material to the generator.</summary>
|
||||
/// <param name="seed">A long value to be mixed into the generator's state.</param>
|
||||
public virtual void AddSeedMaterial(
|
||||
long seed)
|
||||
{
|
||||
lock (this)
|
||||
{
|
||||
windowCount = 0;
|
||||
generator.AddSeedMaterial(seed);
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>Fill byte array with random values.</summary>
|
||||
/// <param name="bytes">Array to be filled.</param>
|
||||
public virtual void NextBytes(
|
||||
byte[] bytes)
|
||||
{
|
||||
doNextBytes(bytes, 0, bytes.Length);
|
||||
}
|
||||
|
||||
/// <summary>Fill byte array with random values.</summary>
|
||||
/// <param name="bytes">Array to receive bytes.</param>
|
||||
/// <param name="start">Index to start filling at.</param>
|
||||
/// <param name="len">Length of segment to fill.</param>
|
||||
public virtual void NextBytes(
|
||||
byte[] bytes,
|
||||
int start,
|
||||
int len)
|
||||
{
|
||||
doNextBytes(bytes, start, len);
|
||||
}
|
||||
|
||||
private void doNextBytes(
|
||||
byte[] bytes,
|
||||
int start,
|
||||
int len)
|
||||
{
|
||||
lock (this)
|
||||
{
|
||||
int done = 0;
|
||||
while (done < len)
|
||||
{
|
||||
if (windowCount < 1)
|
||||
{
|
||||
generator.NextBytes(window, 0, window.Length);
|
||||
windowCount = window.Length;
|
||||
}
|
||||
|
||||
bytes[start + done++] = window[--windowCount];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
97
iTechSharp/srcbc/crypto/prng/ThreadedSeedGenerator.cs
Normal file
97
iTechSharp/srcbc/crypto/prng/ThreadedSeedGenerator.cs
Normal file
@@ -0,0 +1,97 @@
|
||||
using System;
|
||||
using System.Threading;
|
||||
|
||||
namespace Org.BouncyCastle.Crypto.Prng
|
||||
{
|
||||
/**
|
||||
* A thread based seed generator - one source of randomness.
|
||||
* <p>
|
||||
* Based on an idea from Marcus Lippert.
|
||||
* </p>
|
||||
*/
|
||||
public class ThreadedSeedGenerator
|
||||
{
|
||||
private class SeedGenerator
|
||||
{
|
||||
#if NETCF_1_0
|
||||
// No volatile keyword, but all fields implicitly volatile anyway
|
||||
private int counter = 0;
|
||||
private bool stop = false;
|
||||
#else
|
||||
private volatile int counter = 0;
|
||||
private volatile bool stop = false;
|
||||
#endif
|
||||
|
||||
private void Run(object ignored)
|
||||
{
|
||||
while (!this.stop)
|
||||
{
|
||||
this.counter++;
|
||||
}
|
||||
}
|
||||
|
||||
public byte[] GenerateSeed(
|
||||
int numBytes,
|
||||
bool fast)
|
||||
{
|
||||
this.counter = 0;
|
||||
this.stop = false;
|
||||
|
||||
byte[] result = new byte[numBytes];
|
||||
int last = 0;
|
||||
int end = fast ? numBytes : numBytes * 8;
|
||||
|
||||
ThreadPool.QueueUserWorkItem(new WaitCallback(Run));
|
||||
|
||||
for (int i = 0; i < end; i++)
|
||||
{
|
||||
while (this.counter == last)
|
||||
{
|
||||
try
|
||||
{
|
||||
Thread.Sleep(1);
|
||||
}
|
||||
catch (Exception)
|
||||
{
|
||||
// ignore
|
||||
}
|
||||
}
|
||||
|
||||
last = this.counter;
|
||||
|
||||
if (fast)
|
||||
{
|
||||
result[i] = (byte) last;
|
||||
}
|
||||
else
|
||||
{
|
||||
int bytepos = i / 8;
|
||||
result[bytepos] = (byte) ((result[bytepos] << 1) | (last & 1));
|
||||
}
|
||||
}
|
||||
|
||||
this.stop = true;
|
||||
|
||||
return result;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Generate seed bytes. Set fast to false for best quality.
|
||||
* <p>
|
||||
* If fast is set to true, the code should be round about 8 times faster when
|
||||
* generating a long sequence of random bytes. 20 bytes of random values using
|
||||
* the fast mode take less than half a second on a Nokia e70. If fast is set to false,
|
||||
* it takes round about 2500 ms.
|
||||
* </p>
|
||||
* @param numBytes the number of bytes to generate
|
||||
* @param fast true if fast mode should be used
|
||||
*/
|
||||
public byte[] GenerateSeed(
|
||||
int numBytes,
|
||||
bool fast)
|
||||
{
|
||||
return new SeedGenerator().GenerateSeed(numBytes, fast);
|
||||
}
|
||||
}
|
||||
}
|
115
iTechSharp/srcbc/crypto/prng/VMPCRandomGenerator.cs
Normal file
115
iTechSharp/srcbc/crypto/prng/VMPCRandomGenerator.cs
Normal file
@@ -0,0 +1,115 @@
|
||||
namespace Org.BouncyCastle.Crypto.Prng
|
||||
{
|
||||
public class VmpcRandomGenerator
|
||||
: IRandomGenerator
|
||||
{
|
||||
private byte n = 0;
|
||||
|
||||
/// <remarks>
|
||||
/// Permutation generated by code:
|
||||
/// <code>
|
||||
/// // First 1850 fractional digit of Pi number.
|
||||
/// byte[] key = new BigInteger("14159265358979323846...5068006422512520511").ToByteArray();
|
||||
/// s = 0;
|
||||
/// P = new byte[256];
|
||||
/// for (int i = 0; i < 256; i++)
|
||||
/// {
|
||||
/// P[i] = (byte) i;
|
||||
/// }
|
||||
/// for (int m = 0; m < 768; m++)
|
||||
/// {
|
||||
/// s = P[(s + P[m & 0xff] + key[m % key.length]) & 0xff];
|
||||
/// byte temp = P[m & 0xff];
|
||||
/// P[m & 0xff] = P[s & 0xff];
|
||||
/// P[s & 0xff] = temp;
|
||||
/// } </code>
|
||||
/// </remarks>
|
||||
private byte[] P =
|
||||
{
|
||||
(byte) 0xbb, (byte) 0x2c, (byte) 0x62, (byte) 0x7f, (byte) 0xb5, (byte) 0xaa, (byte) 0xd4,
|
||||
(byte) 0x0d, (byte) 0x81, (byte) 0xfe, (byte) 0xb2, (byte) 0x82, (byte) 0xcb, (byte) 0xa0, (byte) 0xa1,
|
||||
(byte) 0x08, (byte) 0x18, (byte) 0x71, (byte) 0x56, (byte) 0xe8, (byte) 0x49, (byte) 0x02, (byte) 0x10,
|
||||
(byte) 0xc4, (byte) 0xde, (byte) 0x35, (byte) 0xa5, (byte) 0xec, (byte) 0x80, (byte) 0x12, (byte) 0xb8,
|
||||
(byte) 0x69, (byte) 0xda, (byte) 0x2f, (byte) 0x75, (byte) 0xcc, (byte) 0xa2, (byte) 0x09, (byte) 0x36,
|
||||
(byte) 0x03, (byte) 0x61, (byte) 0x2d, (byte) 0xfd, (byte) 0xe0, (byte) 0xdd, (byte) 0x05, (byte) 0x43,
|
||||
(byte) 0x90, (byte) 0xad, (byte) 0xc8, (byte) 0xe1, (byte) 0xaf, (byte) 0x57, (byte) 0x9b, (byte) 0x4c,
|
||||
(byte) 0xd8, (byte) 0x51, (byte) 0xae, (byte) 0x50, (byte) 0x85, (byte) 0x3c, (byte) 0x0a, (byte) 0xe4,
|
||||
(byte) 0xf3, (byte) 0x9c, (byte) 0x26, (byte) 0x23, (byte) 0x53, (byte) 0xc9, (byte) 0x83, (byte) 0x97,
|
||||
(byte) 0x46, (byte) 0xb1, (byte) 0x99, (byte) 0x64, (byte) 0x31, (byte) 0x77, (byte) 0xd5, (byte) 0x1d,
|
||||
(byte) 0xd6, (byte) 0x78, (byte) 0xbd, (byte) 0x5e, (byte) 0xb0, (byte) 0x8a, (byte) 0x22, (byte) 0x38,
|
||||
(byte) 0xf8, (byte) 0x68, (byte) 0x2b, (byte) 0x2a, (byte) 0xc5, (byte) 0xd3, (byte) 0xf7, (byte) 0xbc,
|
||||
(byte) 0x6f, (byte) 0xdf, (byte) 0x04, (byte) 0xe5, (byte) 0x95, (byte) 0x3e, (byte) 0x25, (byte) 0x86,
|
||||
(byte) 0xa6, (byte) 0x0b, (byte) 0x8f, (byte) 0xf1, (byte) 0x24, (byte) 0x0e, (byte) 0xd7, (byte) 0x40,
|
||||
(byte) 0xb3, (byte) 0xcf, (byte) 0x7e, (byte) 0x06, (byte) 0x15, (byte) 0x9a, (byte) 0x4d, (byte) 0x1c,
|
||||
(byte) 0xa3, (byte) 0xdb, (byte) 0x32, (byte) 0x92, (byte) 0x58, (byte) 0x11, (byte) 0x27, (byte) 0xf4,
|
||||
(byte) 0x59, (byte) 0xd0, (byte) 0x4e, (byte) 0x6a, (byte) 0x17, (byte) 0x5b, (byte) 0xac, (byte) 0xff,
|
||||
(byte) 0x07, (byte) 0xc0, (byte) 0x65, (byte) 0x79, (byte) 0xfc, (byte) 0xc7, (byte) 0xcd, (byte) 0x76,
|
||||
(byte) 0x42, (byte) 0x5d, (byte) 0xe7, (byte) 0x3a, (byte) 0x34, (byte) 0x7a, (byte) 0x30, (byte) 0x28,
|
||||
(byte) 0x0f, (byte) 0x73, (byte) 0x01, (byte) 0xf9, (byte) 0xd1, (byte) 0xd2, (byte) 0x19, (byte) 0xe9,
|
||||
(byte) 0x91, (byte) 0xb9, (byte) 0x5a, (byte) 0xed, (byte) 0x41, (byte) 0x6d, (byte) 0xb4, (byte) 0xc3,
|
||||
(byte) 0x9e, (byte) 0xbf, (byte) 0x63, (byte) 0xfa, (byte) 0x1f, (byte) 0x33, (byte) 0x60, (byte) 0x47,
|
||||
(byte) 0x89, (byte) 0xf0, (byte) 0x96, (byte) 0x1a, (byte) 0x5f, (byte) 0x93, (byte) 0x3d, (byte) 0x37,
|
||||
(byte) 0x4b, (byte) 0xd9, (byte) 0xa8, (byte) 0xc1, (byte) 0x1b, (byte) 0xf6, (byte) 0x39, (byte) 0x8b,
|
||||
(byte) 0xb7, (byte) 0x0c, (byte) 0x20, (byte) 0xce, (byte) 0x88, (byte) 0x6e, (byte) 0xb6, (byte) 0x74,
|
||||
(byte) 0x8e, (byte) 0x8d, (byte) 0x16, (byte) 0x29, (byte) 0xf2, (byte) 0x87, (byte) 0xf5, (byte) 0xeb,
|
||||
(byte) 0x70, (byte) 0xe3, (byte) 0xfb, (byte) 0x55, (byte) 0x9f, (byte) 0xc6, (byte) 0x44, (byte) 0x4a,
|
||||
(byte) 0x45, (byte) 0x7d, (byte) 0xe2, (byte) 0x6b, (byte) 0x5c, (byte) 0x6c, (byte) 0x66, (byte) 0xa9,
|
||||
(byte) 0x8c, (byte) 0xee, (byte) 0x84, (byte) 0x13, (byte) 0xa7, (byte) 0x1e, (byte) 0x9d, (byte) 0xdc,
|
||||
(byte) 0x67, (byte) 0x48, (byte) 0xba, (byte) 0x2e, (byte) 0xe6, (byte) 0xa4, (byte) 0xab, (byte) 0x7c,
|
||||
(byte) 0x94, (byte) 0x00, (byte) 0x21, (byte) 0xef, (byte) 0xea, (byte) 0xbe, (byte) 0xca, (byte) 0x72,
|
||||
(byte) 0x4f, (byte) 0x52, (byte) 0x98, (byte) 0x3f, (byte) 0xc2, (byte) 0x14, (byte) 0x7b, (byte) 0x3b,
|
||||
(byte) 0x54
|
||||
};
|
||||
|
||||
/// <remarks>Value generated in the same way as <c>P</c>.</remarks>
|
||||
private byte s = (byte) 0xbe;
|
||||
|
||||
public VmpcRandomGenerator()
|
||||
{
|
||||
}
|
||||
|
||||
public virtual void AddSeedMaterial(byte[] seed)
|
||||
{
|
||||
for (int m = 0; m < seed.Length; m++)
|
||||
{
|
||||
s = P[(s + P[n & 0xff] + seed[m]) & 0xff];
|
||||
byte temp = P[n & 0xff];
|
||||
P[n & 0xff] = P[s & 0xff];
|
||||
P[s & 0xff] = temp;
|
||||
n = (byte) ((n + 1) & 0xff);
|
||||
}
|
||||
}
|
||||
|
||||
public virtual void AddSeedMaterial(long seed)
|
||||
{
|
||||
byte[] s = new byte[4];
|
||||
s[3] = (byte) (seed & 0x000000ff);
|
||||
s[2] = (byte) ((seed & 0x0000ff00) >> 8);
|
||||
s[1] = (byte) ((seed & 0x00ff0000) >> 16);
|
||||
s[0] = (byte) ((seed & 0xff000000) >> 24);
|
||||
AddSeedMaterial(s);
|
||||
}
|
||||
|
||||
public virtual void NextBytes(byte[] bytes)
|
||||
{
|
||||
NextBytes(bytes, 0, bytes.Length);
|
||||
}
|
||||
|
||||
public virtual void NextBytes(byte[] bytes, int start, int len)
|
||||
{
|
||||
lock (P)
|
||||
{
|
||||
int end = start + len;
|
||||
for (int i = start; i != end; i++)
|
||||
{
|
||||
s = P[(s + P[n & 0xff]) & 0xff];
|
||||
bytes[i] = P[(P[(P[s & 0xff]) & 0xff] + 1) & 0xff];
|
||||
byte temp = P[n & 0xff];
|
||||
P[n & 0xff] = P[s & 0xff];
|
||||
P[s & 0xff] = temp;
|
||||
n = (byte) ((n + 1) & 0xff);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
Reference in New Issue
Block a user