lsm/DotNetCore.SKIT.FlurlHttpClient.Wechat
1
0
Fork 0
mirror of https://gitee.com/fudiwei/DotNetCore.SKIT.FlurlHttpClient.Wechat.git synced 2025-09-19 18:22:24 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

refactor: SM3

Browse Source
This commit is contained in:
Fu Diwei
2023-06-14 15:41:39 +08:00
parent 01d4629f96
commit c17043385e
2 changed files with 4 additions and 684 deletions
Download Patch File Download Diff File Expand all files Collapse all files

344
src/SKIT.FlurlHttpClient.Wechat.TenpayBusiness/Utilities/SM3Utility.cs
View File

@@ -1,13 +1,13 @@
using System; using System;
using System.Text; using System.Text;
using Org.BouncyCastle.Crypto; using Org.BouncyCastle.Crypto.Digests;
namespace SKIT.FlurlHttpClient.Wechat.TenpayBusiness.Utilities namespace SKIT.FlurlHttpClient.Wechat.TenpayBusiness.Utilities
{ {
/// <summary> /// <summary>
/// SM3 算法工具类。 /// SM3 算法工具类。
/// </summary> /// </summary>
public static partial class SM3Utility public static class SM3Utility
{ {
/// <summary> /// <summary>
/// 获取 SM3 哈希值。 /// 获取 SM3 哈希值。
@@ -39,344 +39,4 @@ namespace SKIT.FlurlHttpClient.Wechat.TenpayBusiness.Utilities
return BitConverter.ToString(hashBytes).Replace("-", string.Empty); return BitConverter.ToString(hashBytes).Replace("-", string.Empty);
} }
} }
partial class SM3Utility
{
internal static class BitOperator
{
public static int URShift(int number, int bits)
{
if (number >= 0)
return number >> bits;
else
return (number >> bits) + (2 << ~bits);
}
public static int URShift(int number, long bits)
{
return URShift(number, (int)bits);
}
public static long URShift(long number, int bits)
{
if (number >= 0)
return number >> bits;
else
return (number >> bits) + (2L << ~bits);
}
public static long URShift(long number, long bits)
{
return URShift(number, (int)bits);
}
}
internal abstract class GeneralDigest : IDigest
{
private const int BYTE_LENGTH = 64;
private readonly byte[] _xBuffer;
private int _xBufferOff;
private long _byteCount;
public abstract string AlgorithmName { get; }
protected GeneralDigest()
{
_xBuffer = new byte[4];
}
protected GeneralDigest(GeneralDigest t)
{
_xBuffer = new byte[t._xBuffer.Length];
Array.Copy(t._xBuffer, 0, _xBuffer, 0, t._xBuffer.Length);
_xBufferOff = t._xBufferOff;
_byteCount = t._byteCount;
}
public abstract int GetDigestSize();
public int GetByteLength()
{
return BYTE_LENGTH;
}
public void Update(byte input)
{
_xBuffer[_xBufferOff++] = input;
if (_xBufferOff == _xBuffer.Length)
{
ProcessWord(_xBuffer, 0);
_xBufferOff = 0;
}
_byteCount++;
}
public void BlockUpdate(byte[] input, int inOff, int inLen)
{
while ((_xBufferOff != 0) && (inLen > 0))
{
Update(input[inOff]);
inOff++;
inLen--;
}
while (inLen > _xBuffer.Length)
{
ProcessWord(input, inOff);
inOff += _xBuffer.Length;
inLen -= _xBuffer.Length;
_byteCount += _xBuffer.Length;
}
while (inLen > 0)
{
Update(input[inOff]);
inOff++;
inLen--;
}
}
public void BlockUpdate(ReadOnlySpan<byte> input)
{
BlockUpdate(input.ToArray(), 0, input.Length);
}
public abstract int DoFinal(byte[] output, int outOff);
public virtual int DoFinal(Span<byte> output)
{
return DoFinal(output.ToArray(), 0);
}
public virtual void Reset()
{
_byteCount = 0;
_xBufferOff = 0;
Array.Clear(_xBuffer, 0, _xBuffer.Length);
}
public void Finish()
{
long bitLength = (_byteCount << 3);
Update(unchecked((byte)128));
while (_xBufferOff != 0)
Update(unchecked((byte)0));
ProcessLength(bitLength);
ProcessBlock();
}
protected abstract void ProcessWord(byte[] input, int inOff);
protected abstract void ProcessLength(long bitLen);
protected abstract void ProcessBlock();
}
internal sealed class SM3Digest : GeneralDigest
{
private const int DIGEST_LENGTH = 32;
private const int T_1 = 0x79cc4519;
private const int T_2 = 0x7a879d8a;
private static readonly int[] IV = new int[] { 0x7380166f, 0x4914b2b9, 0x172442d7, unchecked((int)0xda8a0600), unchecked((int)0xa96f30bc), 0x163138aa, unchecked((int)0xe38dee4d), unchecked((int)0xb0fb0e4e) };
private static readonly int[] X0 = new int[] { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
private readonly int[] _v1 = new int[8];
private readonly int[] _v2 = new int[8];
private readonly int[] _x = new int[68];
private int _xOff;
public override string AlgorithmName { get { return "SM3"; } }
public SM3Digest()
: base()
{
Reset();
}
public SM3Digest(SM3Digest t)
: base(t)
{
Array.Copy(t._x, 0, _x, 0, t._x.Length);
_xOff = t._xOff;
Array.Copy(t._v1, 0, _v1, 0, t._v1.Length);
}
private static void ConvertIntegerToBigEndian(int num, byte[] bytes, int offset)
{
bytes[offset] = (byte)(BitOperator.URShift(num, 24));
bytes[++offset] = (byte)(BitOperator.URShift(num, 16));
bytes[++offset] = (byte)(BitOperator.URShift(num, 8));
bytes[++offset] = (byte)(num);
}
private static int Rotate(int x, int n)
{
return (x << n) | (BitOperator.URShift(x, (32 - n)));
}
private static int P0(int x)
{
return (x) ^ Rotate(x, 9) ^ Rotate(x, 17);
}
private static int P1(int x)
{
return (x) ^ Rotate(x, 15) ^ Rotate(x, 23);
}
private static int FFOne(int x, int y, int z)
{
return (x ^ y ^ z);
}
private static int FFSecond(int x, int y, int z)
{
return ((x & y) | (x & z) | (y & z));
}
private static int GGOne(int x, int y, int z)
{
return (x ^ y ^ z);
}
private static int GGSecond(int x, int y, int z)
{
return ((x & y) | (~x & z));
}
public override int GetDigestSize()
{
return DIGEST_LENGTH;
}
public override int DoFinal(byte[] output, int outOff)
{
Finish();
for (int i = 0; i < 8; i++)
{
ConvertIntegerToBigEndian(_v1[i], output, outOff + i * 4);
}
Reset();
return DIGEST_LENGTH;
}
public override void Reset()
{
base.Reset();
Array.Copy(IV, 0, _v1, 0, IV.Length);
_xOff = 0;
Array.Copy(X0, 0, _x, 0, X0.Length);
}
protected override void ProcessWord(byte[] input, int inOff)
{
int n = input[inOff] << 24;
n |= (input[++inOff] & 0xff) << 16;
n |= (input[++inOff] & 0xff) << 8;
n |= (input[++inOff] & 0xff);
_x[_xOff] = n;
if (++_xOff == 16)
{
ProcessBlock();
}
}
protected override void ProcessLength(long bitLen)
{
if (_xOff > 14)
{
ProcessBlock();
}
_x[14] = (int)(BitOperator.URShift(bitLen, 32));
_x[15] = (int)(bitLen & unchecked((int)0xffffffff));
}
protected override void ProcessBlock()
{
int j;
int[] ww = _x;
int[] ww_ = new int[64];
for (j = 16; j < 68; j++)
{
ww[j] = P1(ww[j - 16] ^ ww[j - 9] ^ (Rotate(ww[j - 3], 15))) ^ (Rotate(ww[j - 13], 7)) ^ ww[j - 6];
}
for (j = 0; j < 64; j++)
{
ww_[j] = ww[j] ^ ww[j + 4];
}
int[] vv = _v1;
int[] vv_ = _v2;
Array.Copy(vv, 0, vv_, 0, IV.Length);
int SS1, SS2, TT1, TT2;
int aaa;
for (j = 0; j < 16; j++)
{
aaa = Rotate(vv_[0], 12);
SS1 = aaa + vv_[4] + Rotate(T_1, j);
SS1 = Rotate(SS1, 7);
SS2 = SS1 ^ aaa;
TT1 = FFOne(vv_[0], vv_[1], vv_[2]) + vv_[3] + SS2 + ww_[j];
TT2 = GGOne(vv_[4], vv_[5], vv_[6]) + vv_[7] + SS1 + ww[j];
vv_[3] = vv_[2];
vv_[2] = Rotate(vv_[1], 9);
vv_[1] = vv_[0];
vv_[0] = TT1;
vv_[7] = vv_[6];
vv_[6] = Rotate(vv_[5], 19);
vv_[5] = vv_[4];
vv_[4] = P0(TT2);
}
for (j = 16; j < 64; j++)
{
aaa = Rotate(vv_[0], 12);
SS1 = aaa + vv_[4] + Rotate(T_2, j);
SS1 = Rotate(SS1, 7);
SS2 = SS1 ^ aaa;
TT1 = FFSecond(vv_[0], vv_[1], vv_[2]) + vv_[3] + SS2 + ww_[j];
TT2 = GGSecond(vv_[4], vv_[5], vv_[6]) + vv_[7] + SS1 + ww[j];
vv_[3] = vv_[2];
vv_[2] = Rotate(vv_[1], 9);
vv_[1] = vv_[0];
vv_[0] = TT1;
vv_[7] = vv_[6];
vv_[6] = Rotate(vv_[5], 19);
vv_[5] = vv_[4];
vv_[4] = P0(TT2);
}
for (j = 0; j < 8; j++)
{
vv[j] ^= vv_[j];
}
_xOff = 0;
Array.Copy(X0, 0, _x, 0, X0.Length);
}
}
}
} }

344
src/SKIT.FlurlHttpClient.Wechat.TenpayV3/Utilities/SM3Utility.cs
View File

@@ -1,13 +1,13 @@
using System; using System;
using System.Text; using System.Text;
using Org.BouncyCastle.Crypto; using Org.BouncyCastle.Crypto.Digests;
namespace SKIT.FlurlHttpClient.Wechat.TenpayV3.Utilities namespace SKIT.FlurlHttpClient.Wechat.TenpayV3.Utilities
{ {
/// <summary> /// <summary>
/// SM3 算法工具类。 /// SM3 算法工具类。
/// </summary> /// </summary>
public static partial class SM3Utility public static class SM3Utility
{ {
/// <summary> /// <summary>
/// 获取 SM3 哈希值。 /// 获取 SM3 哈希值。
@@ -39,344 +39,4 @@ namespace SKIT.FlurlHttpClient.Wechat.TenpayV3.Utilities
return BitConverter.ToString(hashBytes).Replace("-", string.Empty); return BitConverter.ToString(hashBytes).Replace("-", string.Empty);
} }
} }
partial class SM3Utility
{
internal static class BitOperator
{
public static int URShift(int number, int bits)
{
if (number >= 0)
return number >> bits;
else
return (number >> bits) + (2 << ~bits);
}
public static int URShift(int number, long bits)
{
return URShift(number, (int)bits);
}
public static long URShift(long number, int bits)
{
if (number >= 0)
return number >> bits;
else
return (number >> bits) + (2L << ~bits);
}
public static long URShift(long number, long bits)
{
return URShift(number, (int)bits);
}
}
internal abstract class GeneralDigest : IDigest
{
private const int BYTE_LENGTH = 64;
private readonly byte[] _xBuffer;
private int _xBufferOff;
private long _byteCount;
public abstract string AlgorithmName { get; }
protected GeneralDigest()
{
_xBuffer = new byte[4];
}
protected GeneralDigest(GeneralDigest t)
{
_xBuffer = new byte[t._xBuffer.Length];
Array.Copy(t._xBuffer, 0, _xBuffer, 0, t._xBuffer.Length);
_xBufferOff = t._xBufferOff;
_byteCount = t._byteCount;
}
public abstract int GetDigestSize();
public int GetByteLength()
{
return BYTE_LENGTH;
}
public void Update(byte input)
{
_xBuffer[_xBufferOff++] = input;
if (_xBufferOff == _xBuffer.Length)
{
ProcessWord(_xBuffer, 0);
_xBufferOff = 0;
}
_byteCount++;
}
public void BlockUpdate(byte[] input, int inOff, int inLen)
{
while ((_xBufferOff != 0) && (inLen > 0))
{
Update(input[inOff]);
inOff++;
inLen--;
}
while (inLen > _xBuffer.Length)
{
ProcessWord(input, inOff);
inOff += _xBuffer.Length;
inLen -= _xBuffer.Length;
_byteCount += _xBuffer.Length;
}
while (inLen > 0)
{
Update(input[inOff]);
inOff++;
inLen--;
}
}
public void BlockUpdate(ReadOnlySpan<byte> input)
{
BlockUpdate(input.ToArray(), 0, input.Length);
}
public abstract int DoFinal(byte[] output, int outOff);
public virtual int DoFinal(Span<byte> output)
{
return DoFinal(output.ToArray(), 0);
}
public virtual void Reset()
{
_byteCount = 0;
_xBufferOff = 0;
Array.Clear(_xBuffer, 0, _xBuffer.Length);
}
public void Finish()
{
long bitLength = (_byteCount << 3);
Update(unchecked((byte)128));
while (_xBufferOff != 0)
Update(unchecked((byte)0));
ProcessLength(bitLength);
ProcessBlock();
}
protected abstract void ProcessWord(byte[] input, int inOff);
protected abstract void ProcessLength(long bitLen);
protected abstract void ProcessBlock();
}
internal sealed class SM3Digest : GeneralDigest
{
private const int DIGEST_LENGTH = 32;
private const int T_1 = 0x79cc4519;
private const int T_2 = 0x7a879d8a;
private static readonly int[] IV = new int[] { 0x7380166f, 0x4914b2b9, 0x172442d7, unchecked((int)0xda8a0600), unchecked((int)0xa96f30bc), 0x163138aa, unchecked((int)0xe38dee4d), unchecked((int)0xb0fb0e4e) };
private static readonly int[] X0 = new int[] { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
private readonly int[] _v1 = new int[8];
private readonly int[] _v2 = new int[8];
private readonly int[] _x = new int[68];
private int _xOff;
public override string AlgorithmName { get { return "SM3"; } }
public SM3Digest()
: base()
{
Reset();
}
public SM3Digest(SM3Digest t)
: base(t)
{
Array.Copy(t._x, 0, _x, 0, t._x.Length);
_xOff = t._xOff;
Array.Copy(t._v1, 0, _v1, 0, t._v1.Length);
}
private static void ConvertIntegerToBigEndian(int num, byte[] bytes, int offset)
{
bytes[offset] = (byte)(BitOperator.URShift(num, 24));
bytes[++offset] = (byte)(BitOperator.URShift(num, 16));
bytes[++offset] = (byte)(BitOperator.URShift(num, 8));
bytes[++offset] = (byte)(num);
}
private static int Rotate(int x, int n)
{
return (x << n) | (BitOperator.URShift(x, (32 - n)));
}
private static int P0(int x)
{
return (x) ^ Rotate(x, 9) ^ Rotate(x, 17);
}
private static int P1(int x)
{
return (x) ^ Rotate(x, 15) ^ Rotate(x, 23);
}
private static int FFOne(int x, int y, int z)
{
return (x ^ y ^ z);
}
private static int FFSecond(int x, int y, int z)
{
return ((x & y) | (x & z) | (y & z));
}
private static int GGOne(int x, int y, int z)
{
return (x ^ y ^ z);
}
private static int GGSecond(int x, int y, int z)
{
return ((x & y) | (~x & z));
}
public override int GetDigestSize()
{
return DIGEST_LENGTH;
}
public override int DoFinal(byte[] output, int outOff)
{
Finish();
for (int i = 0; i < 8; i++)
{
ConvertIntegerToBigEndian(_v1[i], output, outOff + i * 4);
}
Reset();
return DIGEST_LENGTH;
}
public override void Reset()
{
base.Reset();
Array.Copy(IV, 0, _v1, 0, IV.Length);
_xOff = 0;
Array.Copy(X0, 0, _x, 0, X0.Length);
}
protected override void ProcessWord(byte[] input, int inOff)
{
int n = input[inOff] << 24;
n |= (input[++inOff] & 0xff) << 16;
n |= (input[++inOff] & 0xff) << 8;
n |= (input[++inOff] & 0xff);
_x[_xOff] = n;
if (++_xOff == 16)
{
ProcessBlock();
}
}
protected override void ProcessLength(long bitLen)
{
if (_xOff > 14)
{
ProcessBlock();
}
_x[14] = (int)(BitOperator.URShift(bitLen, 32));
_x[15] = (int)(bitLen & unchecked((int)0xffffffff));
}
protected override void ProcessBlock()
{
int j;
int[] ww = _x;
int[] ww_ = new int[64];
for (j = 16; j < 68; j++)
{
ww[j] = P1(ww[j - 16] ^ ww[j - 9] ^ (Rotate(ww[j - 3], 15))) ^ (Rotate(ww[j - 13], 7)) ^ ww[j - 6];
}
for (j = 0; j < 64; j++)
{
ww_[j] = ww[j] ^ ww[j + 4];
}
int[] vv = _v1;
int[] vv_ = _v2;
Array.Copy(vv, 0, vv_, 0, IV.Length);
int SS1, SS2, TT1, TT2;
int aaa;
for (j = 0; j < 16; j++)
{
aaa = Rotate(vv_[0], 12);
SS1 = aaa + vv_[4] + Rotate(T_1, j);
SS1 = Rotate(SS1, 7);
SS2 = SS1 ^ aaa;
TT1 = FFOne(vv_[0], vv_[1], vv_[2]) + vv_[3] + SS2 + ww_[j];
TT2 = GGOne(vv_[4], vv_[5], vv_[6]) + vv_[7] + SS1 + ww[j];
vv_[3] = vv_[2];
vv_[2] = Rotate(vv_[1], 9);
vv_[1] = vv_[0];
vv_[0] = TT1;
vv_[7] = vv_[6];
vv_[6] = Rotate(vv_[5], 19);
vv_[5] = vv_[4];
vv_[4] = P0(TT2);
}
for (j = 16; j < 64; j++)
{
aaa = Rotate(vv_[0], 12);
SS1 = aaa + vv_[4] + Rotate(T_2, j);
SS1 = Rotate(SS1, 7);
SS2 = SS1 ^ aaa;
TT1 = FFSecond(vv_[0], vv_[1], vv_[2]) + vv_[3] + SS2 + ww_[j];
TT2 = GGSecond(vv_[4], vv_[5], vv_[6]) + vv_[7] + SS1 + ww[j];
vv_[3] = vv_[2];
vv_[2] = Rotate(vv_[1], 9);
vv_[1] = vv_[0];
vv_[0] = TT1;
vv_[7] = vv_[6];
vv_[6] = Rotate(vv_[5], 19);
vv_[5] = vv_[4];
vv_[4] = P0(TT2);
}
for (j = 0; j < 8; j++)
{
vv[j] ^= vv_[j];
}
_xOff = 0;
Array.Copy(X0, 0, _x, 0, X0.Length);
}
}
}
} }