You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
221 lines
6.1 KiB
221 lines
6.1 KiB
7 years ago
|
/* ====================================================================
|
||
|
* Copyright (c) 2014 - 2017 The GmSSL Project. All rights reserved.
|
||
|
*
|
||
|
* Redistribution and use in source and binary forms, with or without
|
||
|
* modification, are permitted provided that the following conditions
|
||
|
* are met:
|
||
|
*
|
||
|
* 1. Redistributions of source code must retain the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer.
|
||
|
*
|
||
|
* 2. 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.
|
||
|
*
|
||
|
* 3. All advertising materials mentioning features or use of this
|
||
|
* software must display the following acknowledgment:
|
||
|
* "This product includes software developed by the GmSSL Project.
|
||
|
* (http://gmssl.org/)"
|
||
|
*
|
||
|
* 4. The name "GmSSL Project" must not be used to endorse or promote
|
||
|
* products derived from this software without prior written
|
||
|
* permission. For written permission, please contact
|
||
|
* guanzhi1980@gmail.com.
|
||
|
*
|
||
|
* 5. Products derived from this software may not be called "GmSSL"
|
||
|
* nor may "GmSSL" appear in their names without prior written
|
||
|
* permission of the GmSSL Project.
|
||
|
*
|
||
|
* 6. Redistributions of any form whatsoever must retain the following
|
||
|
* acknowledgment:
|
||
|
* "This product includes software developed by the GmSSL Project
|
||
|
* (http://gmssl.org/)"
|
||
|
*
|
||
|
* THIS SOFTWARE IS PROVIDED BY THE GmSSL PROJECT ``AS IS'' AND ANY
|
||
|
* EXPRESSED 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 GmSSL PROJECT OR
|
||
|
* ITS 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.
|
||
|
* ====================================================================
|
||
|
*/
|
||
|
|
||
|
#include <string.h>
|
||
|
|
||
|
#include "sm3.h"
|
||
|
|
||
|
void sm3_init(sm3_ctx_t *ctx)
|
||
|
{
|
||
|
ctx->digest[0] = 0x7380166F;
|
||
|
ctx->digest[1] = 0x4914B2B9;
|
||
|
ctx->digest[2] = 0x172442D7;
|
||
|
ctx->digest[3] = 0xDA8A0600;
|
||
|
ctx->digest[4] = 0xA96F30BC;
|
||
|
ctx->digest[5] = 0x163138AA;
|
||
|
ctx->digest[6] = 0xE38DEE4D;
|
||
|
ctx->digest[7] = 0xB0FB0E4E;
|
||
|
|
||
|
ctx->nblocks = 0;
|
||
|
ctx->num = 0;
|
||
|
}
|
||
|
|
||
|
void sm3_update(sm3_ctx_t *ctx, const unsigned char* data, size_t data_len)
|
||
|
{
|
||
|
if (ctx->num) {
|
||
|
unsigned int left = SM3_BLOCK_SIZE - ctx->num;
|
||
|
if (data_len < left) {
|
||
|
memcpy(ctx->block + ctx->num, data, data_len);
|
||
|
ctx->num += data_len;
|
||
|
return;
|
||
|
} else {
|
||
|
memcpy(ctx->block + ctx->num, data, left);
|
||
|
sm3_compress(ctx->digest, ctx->block);
|
||
|
ctx->nblocks++;
|
||
|
data += left;
|
||
|
data_len -= left;
|
||
|
}
|
||
|
}
|
||
|
while (data_len >= SM3_BLOCK_SIZE) {
|
||
|
sm3_compress(ctx->digest, data);
|
||
|
ctx->nblocks++;
|
||
|
data += SM3_BLOCK_SIZE;
|
||
|
data_len -= SM3_BLOCK_SIZE;
|
||
|
}
|
||
|
ctx->num = data_len;
|
||
|
if (data_len) {
|
||
|
memcpy(ctx->block, data, data_len);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
void sm3_close(void *cc, void *dst)
|
||
|
{
|
||
|
sm3_final(cc, dst);
|
||
|
memset(cc, 0, sizeof(sm3_ctx_t));
|
||
|
}
|
||
|
|
||
|
void sm3_final(sm3_ctx_t *ctx, unsigned char *digest)
|
||
|
{
|
||
|
int i;
|
||
|
uint32_t *pdigest = (uint32_t *)digest;
|
||
|
uint32_t *count = (uint32_t *)(ctx->block + SM3_BLOCK_SIZE - 8);
|
||
|
|
||
|
ctx->block[ctx->num] = 0x80;
|
||
|
|
||
|
if (ctx->num + 9 <= SM3_BLOCK_SIZE) {
|
||
|
memset(ctx->block + ctx->num + 1, 0, SM3_BLOCK_SIZE - ctx->num - 9);
|
||
|
} else {
|
||
|
memset(ctx->block + ctx->num + 1, 0, SM3_BLOCK_SIZE - ctx->num - 1);
|
||
|
sm3_compress(ctx->digest, ctx->block);
|
||
|
memset(ctx->block, 0, SM3_BLOCK_SIZE - 8);
|
||
|
}
|
||
|
|
||
|
count[0] = cpu_to_be32((ctx->nblocks) >> 23);
|
||
|
count[1] = cpu_to_be32((ctx->nblocks << 9) + (ctx->num << 3));
|
||
|
|
||
|
sm3_compress(ctx->digest, ctx->block);
|
||
|
for (i = 0; i < sizeof(ctx->digest)/sizeof(ctx->digest[0]); i++) {
|
||
|
pdigest[i] = cpu_to_be32(ctx->digest[i]);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
#define ROTATELEFT(X,n) (((X)<<(n)) | ((X)>>(32-(n))))
|
||
|
|
||
|
#define P0(x) ((x) ^ ROTATELEFT((x),9) ^ ROTATELEFT((x),17))
|
||
|
#define P1(x) ((x) ^ ROTATELEFT((x),15) ^ ROTATELEFT((x),23))
|
||
|
|
||
|
#define FF0(x,y,z) ( (x) ^ (y) ^ (z))
|
||
|
#define FF1(x,y,z) (((x) & (y)) | ( (x) & (z)) | ( (y) & (z)))
|
||
|
|
||
|
#define GG0(x,y,z) ( (x) ^ (y) ^ (z))
|
||
|
#define GG1(x,y,z) (((x) & (y)) | ( (~(x)) & (z)) )
|
||
|
|
||
|
|
||
|
void sm3_compress(uint32_t digest[8], const unsigned char block[64])
|
||
|
{
|
||
|
int j;
|
||
|
uint32_t W[68], W1[64];
|
||
|
const uint32_t *pblock = (const uint32_t *)block;
|
||
|
|
||
|
uint32_t A = digest[0];
|
||
|
uint32_t B = digest[1];
|
||
|
uint32_t C = digest[2];
|
||
|
uint32_t D = digest[3];
|
||
|
uint32_t E = digest[4];
|
||
|
uint32_t F = digest[5];
|
||
|
uint32_t G = digest[6];
|
||
|
uint32_t H = digest[7];
|
||
|
uint32_t SS1,SS2,TT1,TT2,T[64];
|
||
|
|
||
|
for (j = 0; j < 16; j++) {
|
||
|
W[j] = cpu_to_be32(pblock[j]);
|
||
|
}
|
||
|
for (j = 16; j < 68; j++) {
|
||
|
W[j] = P1( W[j-16] ^ W[j-9] ^ ROTATELEFT(W[j-3],15)) ^ ROTATELEFT(W[j - 13],7 ) ^ W[j-6];;
|
||
|
}
|
||
|
for( j = 0; j < 64; j++) {
|
||
|
W1[j] = W[j] ^ W[j+4];
|
||
|
}
|
||
|
|
||
|
for(j =0; j < 16; j++) {
|
||
|
|
||
|
T[j] = 0x79CC4519;
|
||
|
SS1 = ROTATELEFT((ROTATELEFT(A,12) + E + ROTATELEFT(T[j],j)), 7);
|
||
|
SS2 = SS1 ^ ROTATELEFT(A,12);
|
||
|
TT1 = FF0(A,B,C) + D + SS2 + W1[j];
|
||
|
TT2 = GG0(E,F,G) + H + SS1 + W[j];
|
||
|
D = C;
|
||
|
C = ROTATELEFT(B,9);
|
||
|
B = A;
|
||
|
A = TT1;
|
||
|
H = G;
|
||
|
G = ROTATELEFT(F,19);
|
||
|
F = E;
|
||
|
E = P0(TT2);
|
||
|
}
|
||
|
|
||
|
for(j =16; j < 64; j++) {
|
||
|
|
||
|
T[j] = 0x7A879D8A;
|
||
|
SS1 = ROTATELEFT((ROTATELEFT(A,12) + E + ROTATELEFT(T[j],j)), 7);
|
||
|
SS2 = SS1 ^ ROTATELEFT(A,12);
|
||
|
TT1 = FF1(A,B,C) + D + SS2 + W1[j];
|
||
|
TT2 = GG1(E,F,G) + H + SS1 + W[j];
|
||
|
D = C;
|
||
|
C = ROTATELEFT(B,9);
|
||
|
B = A;
|
||
|
A = TT1;
|
||
|
H = G;
|
||
|
G = ROTATELEFT(F,19);
|
||
|
F = E;
|
||
|
E = P0(TT2);
|
||
|
}
|
||
|
|
||
|
digest[0] ^= A;
|
||
|
digest[1] ^= B;
|
||
|
digest[2] ^= C;
|
||
|
digest[3] ^= D;
|
||
|
digest[4] ^= E;
|
||
|
digest[5] ^= F;
|
||
|
digest[6] ^= G;
|
||
|
digest[7] ^= H;
|
||
|
}
|
||
|
|
||
|
void sm3(const unsigned char *msg, size_t msglen,
|
||
|
unsigned char dgst[SM3_DIGEST_LENGTH])
|
||
|
{
|
||
|
sm3_ctx_t ctx;
|
||
|
|
||
|
sm3_init(&ctx);
|
||
|
sm3_update(&ctx, msg, msglen);
|
||
|
sm3_final(&ctx, dgst);
|
||
|
|
||
|
memset(&ctx, 0, sizeof(sm3_ctx_t));
|
||
|
}
|