- Initial commit
This commit is contained in:
194
Runtime/3rdParty/BouncyCastle/crypto/generators/BaseKdfBytesGenerator.cs
vendored
Normal file
194
Runtime/3rdParty/BouncyCastle/crypto/generators/BaseKdfBytesGenerator.cs
vendored
Normal file
@ -0,0 +1,194 @@
|
||||
#if !BESTHTTP_DISABLE_ALTERNATE_SSL && (!UNITY_WEBGL || UNITY_EDITOR)
|
||||
#pragma warning disable
|
||||
using System;
|
||||
|
||||
using Best.HTTP.SecureProtocol.Org.BouncyCastle.Crypto;
|
||||
using Best.HTTP.SecureProtocol.Org.BouncyCastle.Crypto.Parameters;
|
||||
using Best.HTTP.SecureProtocol.Org.BouncyCastle.Crypto.Utilities;
|
||||
|
||||
namespace Best.HTTP.SecureProtocol.Org.BouncyCastle.Crypto.Generators
|
||||
{
|
||||
/**
|
||||
* Basic KDF generator for derived keys and ivs as defined by IEEE P1363a/ISO 18033
|
||||
* <br/>
|
||||
* This implementation is based on ISO 18033/P1363a.
|
||||
*/
|
||||
public abstract class BaseKdfBytesGenerator
|
||||
: IDerivationFunction
|
||||
{
|
||||
private int counterStart;
|
||||
private IDigest digest;
|
||||
private byte[] shared;
|
||||
private byte[] iv;
|
||||
|
||||
/**
|
||||
* Construct a KDF Parameters generator.
|
||||
*
|
||||
* @param counterStart value of counter.
|
||||
* @param digest the digest to be used as the source of derived keys.
|
||||
*/
|
||||
protected BaseKdfBytesGenerator(int counterStart, IDigest digest)
|
||||
{
|
||||
this.counterStart = counterStart;
|
||||
this.digest = digest;
|
||||
}
|
||||
|
||||
public void Init(IDerivationParameters parameters)
|
||||
{
|
||||
if (parameters is KdfParameters kdfParameters)
|
||||
{
|
||||
shared = kdfParameters.GetSharedSecret();
|
||||
iv = kdfParameters.GetIV();
|
||||
}
|
||||
else if (parameters is Iso18033KdfParameters iso18033KdfParameters)
|
||||
{
|
||||
shared = iso18033KdfParameters.GetSeed();
|
||||
iv = null;
|
||||
}
|
||||
else
|
||||
{
|
||||
throw new ArgumentException("KDF parameters required for KDF Generator");
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* return the underlying digest.
|
||||
*/
|
||||
public IDigest Digest => digest;
|
||||
|
||||
/**
|
||||
* fill len bytes of the output buffer with bytes generated from
|
||||
* the derivation function.
|
||||
*
|
||||
* @throws ArgumentException if the size of the request will cause an overflow.
|
||||
* @throws DataLengthException if the out buffer is too small.
|
||||
*/
|
||||
public int GenerateBytes(byte[] output, int outOff, int length)
|
||||
{
|
||||
Check.OutputLength(output, outOff, length, "output buffer too small");
|
||||
|
||||
#if NETCOREAPP2_1_OR_GREATER || NETSTANDARD2_1_OR_GREATER || UNITY_2021_2_OR_NEWER
|
||||
return GenerateBytes(output.AsSpan(outOff, length));
|
||||
#else
|
||||
long oBytes = length;
|
||||
int digestSize = digest.GetDigestSize();
|
||||
|
||||
//
|
||||
// this is at odds with the standard implementation, the
|
||||
// maximum value should be hBits * (2^32 - 1) where hBits
|
||||
// is the digest output size in bits. We can't have an
|
||||
// array with a long index at the moment...
|
||||
//
|
||||
if (oBytes > ((2L << 32) - 1))
|
||||
throw new ArgumentException("Output length too large");
|
||||
|
||||
int cThreshold = (int)((oBytes + digestSize - 1) / digestSize);
|
||||
|
||||
byte[] dig = new byte[digestSize];
|
||||
|
||||
byte[] C = new byte[4];
|
||||
Pack.UInt32_To_BE((uint)counterStart, C, 0);
|
||||
|
||||
uint counterBase = (uint)(counterStart & ~0xFF);
|
||||
|
||||
for (int i = 0; i < cThreshold; i++)
|
||||
{
|
||||
digest.BlockUpdate(shared, 0, shared.Length);
|
||||
digest.BlockUpdate(C, 0, 4);
|
||||
|
||||
if (iv != null)
|
||||
{
|
||||
digest.BlockUpdate(iv, 0, iv.Length);
|
||||
}
|
||||
|
||||
digest.DoFinal(dig, 0);
|
||||
|
||||
if (length > digestSize)
|
||||
{
|
||||
Array.Copy(dig, 0, output, outOff, digestSize);
|
||||
outOff += digestSize;
|
||||
length -= digestSize;
|
||||
}
|
||||
else
|
||||
{
|
||||
Array.Copy(dig, 0, output, outOff, length);
|
||||
}
|
||||
|
||||
if (++C[3] == 0)
|
||||
{
|
||||
counterBase += 0x100;
|
||||
Pack.UInt32_To_BE(counterBase, C, 0);
|
||||
}
|
||||
}
|
||||
|
||||
digest.Reset();
|
||||
|
||||
return (int)oBytes;
|
||||
#endif
|
||||
}
|
||||
|
||||
#if NETCOREAPP2_1_OR_GREATER || NETSTANDARD2_1_OR_GREATER || UNITY_2021_2_OR_NEWER
|
||||
public int GenerateBytes(Span<byte> output)
|
||||
{
|
||||
long oBytes = output.Length;
|
||||
int digestSize = digest.GetDigestSize();
|
||||
|
||||
//
|
||||
// this is at odds with the standard implementation, the
|
||||
// maximum value should be hBits * (2^32 - 1) where hBits
|
||||
// is the digest output size in bits. We can't have an
|
||||
// array with a long index at the moment...
|
||||
//
|
||||
if (oBytes > ((2L << 32) - 1))
|
||||
throw new ArgumentException("Output length too large");
|
||||
|
||||
int cThreshold = (int)((oBytes + digestSize - 1) / digestSize);
|
||||
|
||||
Span<byte> dig = digestSize <= 128
|
||||
? stackalloc byte[digestSize]
|
||||
: new byte[digestSize];
|
||||
|
||||
Span<byte> C = stackalloc byte[4];
|
||||
Pack.UInt32_To_BE((uint)counterStart, C);
|
||||
|
||||
uint counterBase = (uint)(counterStart & ~0xFF);
|
||||
|
||||
for (int i = 0; i < cThreshold; i++)
|
||||
{
|
||||
digest.BlockUpdate(shared);
|
||||
digest.BlockUpdate(C);
|
||||
|
||||
if (iv != null)
|
||||
{
|
||||
digest.BlockUpdate(iv);
|
||||
}
|
||||
|
||||
digest.DoFinal(dig);
|
||||
|
||||
int remaining = output.Length;
|
||||
if (remaining > digestSize)
|
||||
{
|
||||
dig.CopyTo(output);
|
||||
output = output[digestSize..];
|
||||
}
|
||||
else
|
||||
{
|
||||
dig[..remaining].CopyTo(output);
|
||||
}
|
||||
|
||||
if (++C[3] == 0)
|
||||
{
|
||||
counterBase += 0x100;
|
||||
Pack.UInt32_To_BE(counterBase, C);
|
||||
}
|
||||
}
|
||||
|
||||
digest.Reset();
|
||||
|
||||
return (int)oBytes;
|
||||
}
|
||||
#endif
|
||||
}
|
||||
}
|
||||
#pragma warning restore
|
||||
#endif
|
||||
Reference in New Issue
Block a user