mirror of
https://github.com/guanzhi/GmSSL.git
synced 2026-05-07 00:46:17 +08:00
update sm_standard
This commit is contained in:
[GGSuchao]
@@ -1,368 +0,0 @@
|
||||
#include "openssl/sm3_standard.h"
|
||||
|
||||
|
||||
/****************************************************************
|
||||
Function: BiToW
|
||||
Description: calculate W from Bi
|
||||
Calls:
|
||||
Called By: SM3_compress
|
||||
Input: Bi[16] //a block of a message
|
||||
Output: W[64]
|
||||
Return: null
|
||||
Others:
|
||||
****************************************************************/
|
||||
void BiToW(unsigned int Bi[], unsigned int W[])
|
||||
{
|
||||
int i;
|
||||
unsigned int tmp;
|
||||
|
||||
for (i = 0; i <= 15; i++)
|
||||
{
|
||||
W[i] = Bi[i];
|
||||
}
|
||||
for (i = 16; i <= 67; i++)
|
||||
{
|
||||
tmp = W[i - 16]
|
||||
^ W[i - 9]
|
||||
^ SM3_rotl32(W[i - 3], 15);
|
||||
W[i] = SM3_p1(tmp)
|
||||
^ (SM3_rotl32(W[i - 13], 7))
|
||||
^ W[i - 6];
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
/*****************************************************************
|
||||
Function: WToW1
|
||||
Description: calculate W1 from W
|
||||
Calls:
|
||||
Called By: SM3_compress
|
||||
Input: W[64]
|
||||
Output: W1[64]
|
||||
Return: null
|
||||
Others:
|
||||
*****************************************************************/
|
||||
void WToW1(unsigned int W[], unsigned int W1[])
|
||||
{
|
||||
int i;
|
||||
for (i = 0; i <= 63; i++)
|
||||
{
|
||||
W1[i] = W[i] ^ W[i + 4];
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
/******************************************************************
|
||||
Function: CF
|
||||
Description: calculate the CF compress function and update V
|
||||
Calls:
|
||||
Called By: SM3_compress
|
||||
Input: W[64]
|
||||
W1[64]
|
||||
V[8]
|
||||
Output: V[8]
|
||||
Return: null
|
||||
Others:
|
||||
********************************************************************/
|
||||
void CF(unsigned int W[], unsigned int W1[], unsigned int V[])
|
||||
{
|
||||
unsigned int SS1;
|
||||
unsigned int SS2;
|
||||
unsigned int TT1;
|
||||
unsigned int TT2;
|
||||
unsigned int A, B, C, D, E, F, G, H;
|
||||
unsigned int T = SM3_T1;
|
||||
unsigned int FF;
|
||||
unsigned int GG;
|
||||
int j;
|
||||
|
||||
//reg init,set ABCDEFGH=V0
|
||||
A = V[0];
|
||||
B = V[1];
|
||||
C = V[2];
|
||||
D = V[3];
|
||||
E = V[4];
|
||||
F = V[5];
|
||||
G = V[6];
|
||||
H = V[7];
|
||||
|
||||
for (j = 0; j <= 63; j++)
|
||||
{
|
||||
//SS1
|
||||
if (j == 0)
|
||||
{
|
||||
T = SM3_T1;
|
||||
}
|
||||
else if (j == 16)
|
||||
{
|
||||
T = SM3_rotl32(SM3_T2, 16);
|
||||
}
|
||||
else
|
||||
{
|
||||
T = SM3_rotl32(T, 1);
|
||||
}
|
||||
SS1 = SM3_rotl32((SM3_rotl32(A, 12) + E + T), 7);
|
||||
|
||||
//SS2
|
||||
SS2 = SS1^SM3_rotl32(A, 12);
|
||||
|
||||
//TT1
|
||||
if (j <= 15)
|
||||
{
|
||||
FF = SM3_ff0(A, B, C);
|
||||
}
|
||||
|
||||
else
|
||||
{
|
||||
FF = SM3_ff1(A, B, C);
|
||||
}
|
||||
TT1 = FF + D + SS2 + *W1;
|
||||
W1++;
|
||||
|
||||
//TT2
|
||||
if (j <= 15)
|
||||
{
|
||||
GG = SM3_gg0(E, F, G);
|
||||
}
|
||||
else
|
||||
{
|
||||
GG = SM3_gg1(E, F, G);
|
||||
}
|
||||
TT2 = GG + H + SS1 + *W;
|
||||
W++;
|
||||
|
||||
//D
|
||||
D = C;
|
||||
|
||||
//C
|
||||
C = SM3_rotl32(B, 9);
|
||||
|
||||
//B
|
||||
B = A;
|
||||
|
||||
//A
|
||||
A = TT1;
|
||||
|
||||
//H
|
||||
H = G;
|
||||
|
||||
|
||||
//G
|
||||
G = SM3_rotl32(F, 19);
|
||||
|
||||
//F
|
||||
F = E;
|
||||
|
||||
//E
|
||||
E = SM3_p0(TT2);
|
||||
}
|
||||
|
||||
//update V
|
||||
V[0] = A^V[0];
|
||||
V[1] = B^V[1];
|
||||
V[2] = C^V[2];
|
||||
V[3] = D^V[3];
|
||||
V[4] = E^V[4];
|
||||
V[5] = F^V[5];
|
||||
V[6] = G^V[6];
|
||||
V[7] = H^V[7];
|
||||
}
|
||||
|
||||
|
||||
/******************************************************************************
|
||||
Function: BigEndian
|
||||
Description: U32 endian converse.GM/T 0004-2012 requires to use big-endian.
|
||||
if CPU uses little-endian, BigEndian function is a necessary
|
||||
call to change the little-endian format into big-endian format.
|
||||
Calls:
|
||||
Called By: SM3_compress, SM3_done
|
||||
Input: src[bytelen]
|
||||
bytelen
|
||||
Output: des[bytelen]
|
||||
Return: null
|
||||
Others: src and des could implies the same address
|
||||
*******************************************************************************/
|
||||
void BigEndian(unsigned char src[], unsigned int bytelen, unsigned char des[])
|
||||
{
|
||||
unsigned char tmp = 0;
|
||||
unsigned int i = 0;
|
||||
|
||||
for (i = 0; i<bytelen / 4; i++)
|
||||
{
|
||||
tmp = des[4 * i];
|
||||
des[4 * i] = src[4 * i + 3];
|
||||
src[4 * i + 3] = tmp;
|
||||
|
||||
tmp = des[4 * i + 1];
|
||||
des[4 * i + 1] = src[4 * i + 2];
|
||||
des[4 * i + 2] = tmp;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
/******************************************************************************
|
||||
Function: SM3_init
|
||||
Description: initiate SM3 state
|
||||
Calls:
|
||||
Called By: SM3_256
|
||||
Input: SM3_STATE *md
|
||||
Output: SM3_STATE *md
|
||||
Return: null
|
||||
Others:
|
||||
*******************************************************************************/
|
||||
void SM3_init(SM3_STATE *md)
|
||||
{
|
||||
md->curlen = md->length = 0;
|
||||
md->state[0] = SM3_IVA;
|
||||
md->state[1] = SM3_IVB;
|
||||
md->state[2] = SM3_IVC;
|
||||
md->state[3] = SM3_IVD;
|
||||
md->state[4] = SM3_IVE;
|
||||
md->state[5] = SM3_IVF;
|
||||
md->state[6] = SM3_IVG;
|
||||
md->state[7] = SM3_IVH;
|
||||
}
|
||||
|
||||
|
||||
/******************************************************************************
|
||||
Function: SM3_compress
|
||||
Description: compress a single block of message
|
||||
Calls: BigEndian
|
||||
BiToW
|
||||
WToW1
|
||||
CF
|
||||
Called By: SM3_256
|
||||
Input: SM3_STATE *md
|
||||
Output: SM3_STATE *md
|
||||
Return: null
|
||||
Others:
|
||||
*******************************************************************************/
|
||||
void SM3_compress(SM3_STATE * md)
|
||||
{
|
||||
unsigned int W[68];
|
||||
unsigned int W1[64];
|
||||
|
||||
//if CPU uses little-endian, BigEndian function is a necessary call
|
||||
BigEndian(md->buf, 64, md->buf);
|
||||
|
||||
BiToW((unsigned int *)md->buf, W);
|
||||
WToW1(W, W1);
|
||||
CF(W, W1, md->state);
|
||||
}
|
||||
|
||||
|
||||
/******************************************************************************
|
||||
Function: SM3_process
|
||||
Description: compress the first (len/64) blocks of message
|
||||
Calls: SM3_compress
|
||||
Called By: SM3_256
|
||||
Input: SM3_STATE *md
|
||||
unsigned char buf[len] //the input message
|
||||
int len //bytelen of message
|
||||
Output: SM3_STATE *md
|
||||
Return: null
|
||||
Others:
|
||||
*******************************************************************************/
|
||||
void SM3_process(SM3_STATE * md, unsigned char *buf, int len)
|
||||
{
|
||||
while (len--)
|
||||
{
|
||||
/* copy byte */
|
||||
md->buf[md->curlen] = *buf++;
|
||||
md->curlen++;
|
||||
|
||||
/* is 64 bytes full? */
|
||||
if (md->curlen == 64)
|
||||
{
|
||||
SM3_compress(md);
|
||||
md->length += 512;
|
||||
md->curlen = 0;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
/******************************************************************************
|
||||
Function: SM3_done
|
||||
Description: compress the rest message that the SM3_process has left behind
|
||||
Calls: SM3_compress
|
||||
Called By: SM3_256
|
||||
Input: SM3_STATE *md
|
||||
Output: unsigned char *hash
|
||||
Return: null
|
||||
Others:
|
||||
*******************************************************************************/
|
||||
void SM3_done(SM3_STATE *md, unsigned char hash[])
|
||||
{
|
||||
int i;
|
||||
unsigned char tmp = 0;
|
||||
|
||||
/* increase the bit length of the message */
|
||||
md->length += md->curlen << 3;
|
||||
|
||||
/* append the '1' bit */
|
||||
md->buf[md->curlen] = 0x80;
|
||||
md->curlen++;
|
||||
|
||||
/* if the length is currently above 56 bytes, appends zeros till
|
||||
it reaches 64 bytes, compress the current block, creat a new
|
||||
block by appending zeros and length,and then compress it
|
||||
*/
|
||||
if (md->curlen >56)
|
||||
{
|
||||
for (; md->curlen < 64;)
|
||||
{
|
||||
md->buf[md->curlen] = 0;
|
||||
md->curlen++;
|
||||
}
|
||||
SM3_compress(md);
|
||||
md->curlen = 0;
|
||||
}
|
||||
|
||||
/* if the length is less than 56 bytes, pad upto 56 bytes of zeroes */
|
||||
for (; md->curlen < 56;)
|
||||
{
|
||||
md->buf[md->curlen] = 0;
|
||||
md->curlen++;
|
||||
}
|
||||
|
||||
/* since all messages are under 2^32 bits we mark the top bits zero */
|
||||
for (i = 56; i < 60; i++)
|
||||
{
|
||||
md->buf[i] = 0;
|
||||
}
|
||||
|
||||
/* append length */
|
||||
md->buf[63] = md->length & 0xff;
|
||||
md->buf[62] = (md->length >> 8) & 0xff;
|
||||
md->buf[61] = (md->length >> 16) & 0xff;
|
||||
md->buf[60] = (md->length >> 24) & 0xff;
|
||||
|
||||
SM3_compress(md);
|
||||
|
||||
/* copy output */
|
||||
memcpy(hash, md->state, SM3_len / 8);
|
||||
BigEndian(hash, SM3_len / 8, hash);//if CPU uses little-endian, BigEndian function is a necessary call
|
||||
}
|
||||
|
||||
|
||||
/******************************************************************************
|
||||
Function: SM3_256
|
||||
Description: calculate a hash value from a given message
|
||||
Calls: SM3_init
|
||||
SM3_process
|
||||
SM3_done
|
||||
Called By:
|
||||
Input: unsigned char buf[len] //the input message
|
||||
int len //bytelen of the message
|
||||
Output: unsigned char hash[32]
|
||||
Return: null
|
||||
Others:
|
||||
*******************************************************************************/
|
||||
void SM3_256(unsigned char buf[], int len, unsigned char hash[])
|
||||
{
|
||||
SM3_STATE md;
|
||||
SM3_init(&md);
|
||||
SM3_process(&md, buf, len);
|
||||
SM3_done(&md, hash);
|
||||
}
|
||||
Reference in New Issue
Block a user