blake2s hash
This commit is contained in:
Kelvin Sherlock
parent
904eee0975
commit
68296e0608
496
src/hashes/blake2s.c
Normal file
496
src/hashes/blake2s.c
Normal file
@ -0,0 +1,496 @@
|
||||
/* LibTomCrypt, modular cryptographic library -- Tom St Denis
|
||||
*
|
||||
* LibTomCrypt is a library that provides various cryptographic
|
||||
* algorithms in a highly modular and flexible manner.
|
||||
*
|
||||
* The library is free for all purposes without any express
|
||||
* guarantee it works.
|
||||
*/
|
||||
|
||||
/* based on https://github.com/BLAKE2/BLAKE2/blob/master/ref/blake2s-ref.c public domain/cc0 */
|
||||
/* see also https://www.ietf.org/rfc/rfc7693.txt */
|
||||
|
||||
#include "tomcrypt.h"
|
||||
|
||||
#ifdef LTC_BLAKE2S
|
||||
|
||||
enum blake2s_constant {
|
||||
BLAKE2S_BLOCKBYTES = 64,
|
||||
BLAKE2S_OUTBYTES = 32,
|
||||
BLAKE2S_KEYBYTES = 32,
|
||||
BLAKE2S_SALTBYTES = 8,
|
||||
BLAKE2S_PERSONALBYTES = 8
|
||||
};
|
||||
|
||||
|
||||
struct blake2s_param {
|
||||
unsigned char digest_length;
|
||||
unsigned char key_length;
|
||||
unsigned char fanout;
|
||||
unsigned char depth;
|
||||
ulong32 leaf_length;
|
||||
unsigned char node_offset[6];
|
||||
unsigned char node_depth;
|
||||
unsigned char inner_length;
|
||||
unsigned char salt[BLAKE2S_SALTBYTES];
|
||||
unsigned char personal[BLAKE2S_PERSONALBYTES];
|
||||
};
|
||||
|
||||
|
||||
|
||||
const struct ltc_hash_descriptor blake2s_256_desc =
|
||||
{
|
||||
"blake2s_256",
|
||||
0,
|
||||
32,
|
||||
64,
|
||||
{ 1, 3, 6, 1, 4, 1, 1722, 12, 2, 2, 8 },
|
||||
11,
|
||||
&blake2s_256_init,
|
||||
&blake2s_process,
|
||||
&blake2s_done,
|
||||
&blake2s_256_test,
|
||||
NULL
|
||||
};
|
||||
|
||||
|
||||
const struct ltc_hash_descriptor blake2s_224_desc =
|
||||
{
|
||||
"blake2s_224",
|
||||
0,
|
||||
32,
|
||||
64,
|
||||
{ 1, 3, 6, 1, 4, 1, 1722, 12, 2, 2, 7 },
|
||||
11,
|
||||
&blake2s_224_init,
|
||||
&blake2s_process,
|
||||
&blake2s_done,
|
||||
&blake2s_224_test,
|
||||
NULL
|
||||
};
|
||||
|
||||
const struct ltc_hash_descriptor blake2s_160_desc =
|
||||
{
|
||||
"blake2s_160",
|
||||
0,
|
||||
32,
|
||||
64,
|
||||
{ 1, 3, 6, 1, 4, 1, 1722, 12, 2, 2, 5 },
|
||||
11,
|
||||
&blake2s_160_init,
|
||||
&blake2s_process,
|
||||
&blake2s_done,
|
||||
&blake2s_160_test,
|
||||
NULL
|
||||
};
|
||||
|
||||
|
||||
const struct ltc_hash_descriptor blake2s_128_desc =
|
||||
{
|
||||
"blake2s_128",
|
||||
0,
|
||||
16,
|
||||
64,
|
||||
{ 1, 3, 6, 1, 4, 1, 1722, 12, 2, 2, 4 },
|
||||
11,
|
||||
&blake2s_128_init,
|
||||
&blake2s_process,
|
||||
&blake2s_done,
|
||||
&blake2s_128_test,
|
||||
NULL
|
||||
};
|
||||
|
||||
|
||||
|
||||
static const ulong32 blake2s_IV[8] = {
|
||||
0x6A09E667UL, 0xBB67AE85UL, 0x3C6EF372UL, 0xA54FF53AUL,
|
||||
0x510E527FUL, 0x9B05688CUL, 0x1F83D9ABUL, 0x5BE0CD19UL
|
||||
};
|
||||
|
||||
static const unsigned char blake2s_sigma[10][16] = {
|
||||
{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 },
|
||||
{ 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 },
|
||||
{ 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4 },
|
||||
{ 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8 },
|
||||
{ 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13 },
|
||||
{ 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9 },
|
||||
{ 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11 },
|
||||
{ 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10 },
|
||||
{ 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5 },
|
||||
{ 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0 },
|
||||
};
|
||||
|
||||
static inline int blake2s_set_lastnode(struct blake2s_state *S)
|
||||
{
|
||||
S->f[1] = ~0U;
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* Some helper functions, not necessarily useful */
|
||||
static inline int blake2s_set_lastblock(struct blake2s_state *S)
|
||||
{
|
||||
if (S->last_node)
|
||||
blake2s_set_lastnode(S);
|
||||
|
||||
S->f[0] = ~0U;
|
||||
return 0;
|
||||
}
|
||||
|
||||
static inline int blake2s_increment_counter(struct blake2s_state *S, const ulong32 inc)
|
||||
{
|
||||
S->t[0] += inc;
|
||||
S->t[1] += (S->t[0] < inc);
|
||||
return 0;
|
||||
}
|
||||
|
||||
static inline int blake2s_init0(struct blake2s_state *S)
|
||||
{
|
||||
XMEMSET(S, 0, sizeof(struct blake2s_state));
|
||||
|
||||
for (int i = 0; i < 8; ++i)
|
||||
S->h[i] = blake2s_IV[i];
|
||||
|
||||
return CRYPT_OK;
|
||||
}
|
||||
|
||||
/* init2 xors IV with input parameter block */
|
||||
static int blake2s_init_param(struct blake2s_state *S, const struct blake2s_param *P)
|
||||
{
|
||||
blake2s_init0(S);
|
||||
ulong32 *p = (ulong32 *)(P);
|
||||
|
||||
/* IV XOR ParamBlock */
|
||||
for (size_t i = 0; i < 8; ++i) {
|
||||
ulong32 tmp;
|
||||
LOAD32L(tmp, &p[i]);
|
||||
S->h[i] ^= tmp;
|
||||
}
|
||||
|
||||
S->outlen = P->digest_length;
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* Sequential blake2s initialization */
|
||||
int blake2s_init(hash_state *md, size_t outlen)
|
||||
{
|
||||
struct blake2s_param P[1];
|
||||
LTC_ARGCHK(md != NULL);
|
||||
|
||||
XMEMSET(P, 0, sizeof(P));
|
||||
|
||||
if ((!outlen) || (outlen > BLAKE2S_OUTBYTES))
|
||||
return CRYPT_INVALID_ARG;
|
||||
|
||||
P->digest_length = (unsigned char)outlen;
|
||||
|
||||
P->fanout = 1;
|
||||
P->depth = 1;
|
||||
|
||||
return blake2s_init_param(&md->blake2s, P);
|
||||
}
|
||||
|
||||
int blake2s_256_init(hash_state *md) { return blake2s_init(md, 32); }
|
||||
|
||||
int blake2s_224_init(hash_state *md) { return blake2s_init(md, 28); }
|
||||
|
||||
int blake2s_160_init(hash_state *md) { return blake2s_init(md, 20); }
|
||||
|
||||
int blake2s_128_init(hash_state *md) { return blake2s_init(md, 16); }
|
||||
|
||||
|
||||
#define G(r,i,a,b,c,d) \
|
||||
do { \
|
||||
a = a + b + m[blake2s_sigma[r][2*i+0]]; \
|
||||
d = ROR(d ^ a, 16); \
|
||||
c = c + d; \
|
||||
b = ROR(b ^ c, 12); \
|
||||
a = a + b + m[blake2s_sigma[r][2*i+1]]; \
|
||||
d = ROR(d ^ a, 8); \
|
||||
c = c + d; \
|
||||
b = ROR(b ^ c, 7); \
|
||||
} while(0)
|
||||
#define ROUND(r) \
|
||||
do { \
|
||||
G(r,0,v[ 0],v[ 4],v[ 8],v[12]); \
|
||||
G(r,1,v[ 1],v[ 5],v[ 9],v[13]); \
|
||||
G(r,2,v[ 2],v[ 6],v[10],v[14]); \
|
||||
G(r,3,v[ 3],v[ 7],v[11],v[15]); \
|
||||
G(r,4,v[ 0],v[ 5],v[10],v[15]); \
|
||||
G(r,5,v[ 1],v[ 6],v[11],v[12]); \
|
||||
G(r,6,v[ 2],v[ 7],v[ 8],v[13]); \
|
||||
G(r,7,v[ 3],v[ 4],v[ 9],v[14]); \
|
||||
} while(0)
|
||||
|
||||
|
||||
#ifdef LTC_CLEAN_STACK
|
||||
static int _blake2s_compress(hash_state *md, unsigned char *buf)
|
||||
#else
|
||||
static int blake2s_compress(hash_state *md, unsigned char *buf)
|
||||
#endif
|
||||
{
|
||||
ulong32 m[16];
|
||||
ulong32 v[16];
|
||||
|
||||
for (size_t i = 0; i < 16; ++i) {
|
||||
LOAD32L(m[i], buf + i * sizeof(m[i]));
|
||||
}
|
||||
|
||||
for (size_t i = 0; i < 8; ++i)
|
||||
v[i] = md->blake2s.h[i];
|
||||
|
||||
v[8] = blake2s_IV[0];
|
||||
v[9] = blake2s_IV[1];
|
||||
v[10] = blake2s_IV[2];
|
||||
v[11] = blake2s_IV[3];
|
||||
v[12] = md->blake2s.t[0] ^ blake2s_IV[4];
|
||||
v[13] = md->blake2s.t[1] ^ blake2s_IV[5];
|
||||
v[14] = md->blake2s.f[0] ^ blake2s_IV[6];
|
||||
v[15] = md->blake2s.f[1] ^ blake2s_IV[7];
|
||||
|
||||
|
||||
ROUND(0);
|
||||
ROUND(1);
|
||||
ROUND(2);
|
||||
ROUND(3);
|
||||
ROUND(4);
|
||||
ROUND(5);
|
||||
ROUND(6);
|
||||
ROUND(7);
|
||||
ROUND(8);
|
||||
ROUND(9);
|
||||
|
||||
for (size_t i = 0; i < 8; ++i)
|
||||
md->blake2s.h[i] = md->blake2s.h[i] ^ v[i] ^ v[i + 8];
|
||||
|
||||
|
||||
return 0;
|
||||
}
|
||||
#undef G
|
||||
#undef ROUND
|
||||
|
||||
|
||||
#ifdef LTC_CLEAN_STACK
|
||||
static int blake2s_compress(hash_state *md, unsigned char *buf)
|
||||
{
|
||||
int err;
|
||||
err = _blake2s_compress(md, buf);
|
||||
burn_stack(sizeof(ulong32) * 32);
|
||||
return err;
|
||||
}
|
||||
#endif
|
||||
|
||||
int blake2s_process(hash_state *md, const unsigned char *in, unsigned long inlen)
|
||||
{
|
||||
LTC_ARGCHK(md != NULL);
|
||||
LTC_ARGCHK(in != NULL);
|
||||
|
||||
if (md->blake2s.curlen > sizeof(md->blake2s.buf)) {
|
||||
return CRYPT_INVALID_ARG;
|
||||
}
|
||||
|
||||
while (inlen > 0) {
|
||||
ulong32 left = md->blake2s.curlen;
|
||||
ulong32 fill = 2 * BLAKE2S_BLOCKBYTES - left;
|
||||
|
||||
if (inlen > fill) {
|
||||
XMEMCPY(md->blake2s.buf + left, in, fill);
|
||||
md->blake2s.curlen += fill;
|
||||
blake2s_increment_counter(&md->blake2s, BLAKE2S_BLOCKBYTES);
|
||||
blake2s_compress(md, md->blake2s.buf);
|
||||
XMEMCPY(md->blake2s.buf, md->blake2s.buf + BLAKE2S_BLOCKBYTES, BLAKE2S_BLOCKBYTES);
|
||||
md->blake2s.curlen -= BLAKE2S_BLOCKBYTES;
|
||||
in += fill;
|
||||
inlen -= fill;
|
||||
} else /* inlen <= fill */
|
||||
{
|
||||
XMEMCPY(md->blake2s.buf + left, in, inlen);
|
||||
md->blake2s.curlen += (ulong32)inlen; /* Be lazy, do not compress */
|
||||
in += inlen;
|
||||
inlen -= inlen;
|
||||
}
|
||||
}
|
||||
|
||||
return CRYPT_OK;
|
||||
}
|
||||
|
||||
int blake2s_done(hash_state *md, unsigned char *out)
|
||||
{
|
||||
unsigned char buffer[BLAKE2S_OUTBYTES];
|
||||
size_t i;
|
||||
|
||||
LTC_ARGCHK(md != NULL);
|
||||
LTC_ARGCHK(out != NULL);
|
||||
|
||||
/* if(S->outlen != outlen) return CRYPT_INVALID_ARG; */
|
||||
|
||||
if (md->blake2s.curlen > BLAKE2S_BLOCKBYTES) {
|
||||
blake2s_increment_counter(&md->blake2s, BLAKE2S_BLOCKBYTES);
|
||||
blake2s_compress(md, md->blake2s.buf);
|
||||
md->blake2s.curlen -= BLAKE2S_BLOCKBYTES;
|
||||
XMEMCPY(md->blake2s.buf, md->blake2s.buf + BLAKE2S_BLOCKBYTES, md->blake2s.curlen);
|
||||
}
|
||||
|
||||
blake2s_increment_counter(&md->blake2s, (ulong32)md->blake2s.curlen);
|
||||
blake2s_set_lastblock(&md->blake2s);
|
||||
XMEMSET(md->blake2s.buf + md->blake2s.curlen, 0, 2 * BLAKE2S_BLOCKBYTES - md->blake2s.curlen); /* Padding */
|
||||
blake2s_compress(md, md->blake2s.buf);
|
||||
|
||||
for (i = 0; i < 8; ++i) /* Output full hash to temp buffer */
|
||||
STORE32L(md->blake2s.h[i], buffer + sizeof(md->blake2s.h[i]) * i);
|
||||
|
||||
XMEMCPY(out, buffer, md->blake2s.outlen);
|
||||
return CRYPT_OK;
|
||||
}
|
||||
|
||||
/**
|
||||
Self-test the hash
|
||||
@return CRYPT_OK if successful, CRYPT_NOP if self-tests have been disabled
|
||||
*/
|
||||
int blake2s_256_test(void)
|
||||
{
|
||||
#ifndef LTC_TEST
|
||||
return CRYPT_NOP;
|
||||
#else
|
||||
static const struct {
|
||||
char *msg;
|
||||
unsigned char hash[32];
|
||||
} tests[] = {
|
||||
{ "",
|
||||
{ 0x69, 0x21, 0x7a, 0x30, 0x79, 0x90, 0x80, 0x94,
|
||||
0xe1, 0x11, 0x21, 0xd0, 0x42, 0x35, 0x4a, 0x7c,
|
||||
0x1f, 0x55, 0xb6, 0x48, 0x2c, 0xa1, 0xa5, 0x1e,
|
||||
0x1b, 0x25, 0x0d, 0xfd, 0x1e, 0xd0, 0xee, 0xf9 } },
|
||||
|
||||
{ NULL, { 0 } }
|
||||
};
|
||||
|
||||
int i;
|
||||
unsigned char tmp[32];
|
||||
hash_state md;
|
||||
|
||||
for (i = 0; tests[i].msg != NULL; i++) {
|
||||
blake2s_256_init(&md);
|
||||
blake2s_process(&md, (unsigned char *)tests[i].msg, (unsigned long)strlen(tests[i].msg));
|
||||
blake2s_done(&md, tmp);
|
||||
if (XMEMCMP(tmp, tests[i].hash, 32) != 0) {
|
||||
return CRYPT_FAIL_TESTVECTOR;
|
||||
}
|
||||
}
|
||||
return CRYPT_OK;
|
||||
#endif
|
||||
}
|
||||
|
||||
/**
|
||||
Self-test the hash
|
||||
@return CRYPT_OK if successful, CRYPT_NOP if self-tests have been disabled
|
||||
*/
|
||||
int blake2s_224_test(void)
|
||||
{
|
||||
#ifndef LTC_TEST
|
||||
return CRYPT_NOP;
|
||||
#else
|
||||
static const struct {
|
||||
char *msg;
|
||||
unsigned char hash[28];
|
||||
} tests[] = {
|
||||
{ "",
|
||||
{ 0x1f, 0xa1, 0x29, 0x1e, 0x65, 0x24, 0x8b, 0x37,
|
||||
0xb3, 0x43, 0x34, 0x75, 0xb2, 0xa0, 0xdd, 0x63,
|
||||
0xd5, 0x4a, 0x11, 0xec, 0xc4, 0xe3, 0xe0, 0x34,
|
||||
0xe7, 0xbc, 0x1e, 0xf4 } },
|
||||
|
||||
{ NULL, { 0 } }
|
||||
};
|
||||
|
||||
int i;
|
||||
unsigned char tmp[28];
|
||||
hash_state md;
|
||||
|
||||
for (i = 0; tests[i].msg != NULL; i++) {
|
||||
blake2s_224_init(&md);
|
||||
blake2s_process(&md, (unsigned char *)tests[i].msg, (unsigned long)strlen(tests[i].msg));
|
||||
blake2s_done(&md, tmp);
|
||||
if (XMEMCMP(tmp, tests[i].hash, 28) != 0) {
|
||||
return CRYPT_FAIL_TESTVECTOR;
|
||||
}
|
||||
}
|
||||
return CRYPT_OK;
|
||||
#endif
|
||||
}
|
||||
|
||||
/**
|
||||
Self-test the hash
|
||||
@return CRYPT_OK if successful, CRYPT_NOP if self-tests have been disabled
|
||||
*/
|
||||
int blake2s_160_test(void)
|
||||
{
|
||||
#ifndef LTC_TEST
|
||||
return CRYPT_NOP;
|
||||
#else
|
||||
static const struct {
|
||||
char *msg;
|
||||
unsigned char hash[20];
|
||||
} tests[] = {
|
||||
{ "",
|
||||
{ 0x35, 0x4c, 0x9c, 0x33, 0xf7, 0x35, 0x96, 0x24,
|
||||
0x18, 0xbd, 0xac, 0xb9, 0x47, 0x98, 0x73, 0x42,
|
||||
0x9c, 0x34, 0x91, 0x6f} },
|
||||
|
||||
{ NULL, { 0 } }
|
||||
};
|
||||
|
||||
int i;
|
||||
unsigned char tmp[20];
|
||||
hash_state md;
|
||||
|
||||
for (i = 0; tests[i].msg != NULL; i++) {
|
||||
blake2s_160_init(&md);
|
||||
blake2s_process(&md, (unsigned char *)tests[i].msg, (unsigned long)strlen(tests[i].msg));
|
||||
blake2s_done(&md, tmp);
|
||||
if (XMEMCMP(tmp, tests[i].hash, 20) != 0) {
|
||||
return CRYPT_FAIL_TESTVECTOR;
|
||||
}
|
||||
}
|
||||
return CRYPT_OK;
|
||||
#endif
|
||||
}
|
||||
|
||||
/**
|
||||
Self-test the hash
|
||||
@return CRYPT_OK if successful, CRYPT_NOP if self-tests have been disabled
|
||||
*/
|
||||
int blake2s_128_test(void)
|
||||
{
|
||||
#ifndef LTC_TEST
|
||||
return CRYPT_NOP;
|
||||
#else
|
||||
static const struct {
|
||||
char *msg;
|
||||
unsigned char hash[16];
|
||||
} tests[] = {
|
||||
{ "",
|
||||
{ 0x64, 0x55, 0x0d, 0x6f, 0xfe, 0x2c, 0x0a, 0x01,
|
||||
0xa1, 0x4a, 0xba, 0x1e, 0xad, 0xe0, 0x20, 0x0c } },
|
||||
|
||||
{ NULL, { 0 } }
|
||||
};
|
||||
|
||||
int i;
|
||||
unsigned char tmp[16];
|
||||
hash_state md;
|
||||
|
||||
for (i = 0; tests[i].msg != NULL; i++) {
|
||||
blake2s_128_init(&md);
|
||||
blake2s_process(&md, (unsigned char *)tests[i].msg, (unsigned long)strlen(tests[i].msg));
|
||||
blake2s_done(&md, tmp);
|
||||
if (XMEMCMP(tmp, tests[i].hash, 16) != 0) {
|
||||
return CRYPT_FAIL_TESTVECTOR;
|
||||
}
|
||||
}
|
||||
return CRYPT_OK;
|
||||
#endif
|
||||
}
|
||||
|
||||
|
||||
|
||||
#endif
|
||||
@ -242,6 +242,7 @@
|
||||
#define LTC_RIPEMD160
|
||||
#define LTC_RIPEMD256
|
||||
#define LTC_RIPEMD320
|
||||
#define LTC_BLAKE2S
|
||||
|
||||
#define LTC_HASH_HELPERS
|
||||
|
||||
|
||||
@ -113,6 +113,21 @@ struct chc_state {
|
||||
};
|
||||
#endif
|
||||
|
||||
|
||||
#ifdef LTC_BLAKE2S
|
||||
|
||||
struct blake2s_state {
|
||||
ulong32 h[8];
|
||||
ulong32 t[2];
|
||||
ulong32 f[2];
|
||||
unsigned char buf[2 * 64];
|
||||
ulong32 curlen;
|
||||
unsigned char outlen;
|
||||
unsigned char last_node;
|
||||
};
|
||||
|
||||
#endif
|
||||
|
||||
typedef union Hash_state {
|
||||
char dummy[1];
|
||||
#ifdef LTC_CHC_HASH
|
||||
@ -157,6 +172,11 @@ typedef union Hash_state {
|
||||
#ifdef LTC_RIPEMD320
|
||||
struct rmd320_state rmd320;
|
||||
#endif
|
||||
|
||||
#ifdef LTC_BLAKE2S
|
||||
struct blake2s_state blake2s;
|
||||
#endif
|
||||
|
||||
void *data;
|
||||
} hash_state;
|
||||
|
||||
@ -314,6 +334,29 @@ int sha1_test(void);
|
||||
extern const struct ltc_hash_descriptor sha1_desc;
|
||||
#endif
|
||||
|
||||
#ifdef LTC_BLAKE2S
|
||||
extern const struct ltc_hash_descriptor blake2s_256_desc;
|
||||
int blake2s_256_init(hash_state * md);
|
||||
int blake2s_256_test(void);
|
||||
|
||||
extern const struct ltc_hash_descriptor blake2s_224_desc;
|
||||
int blake2s_224_init(hash_state * md);
|
||||
int blake2s_224_test(void);
|
||||
|
||||
extern const struct ltc_hash_descriptor blake2s_160_desc;
|
||||
int blake2s_160_init(hash_state * md);
|
||||
int blake2s_160_test(void);
|
||||
|
||||
extern const struct ltc_hash_descriptor blake2s_128_desc;
|
||||
int blake2s_128_init(hash_state * md);
|
||||
int blake2s_128_test(void);
|
||||
|
||||
int blake2s_init(hash_state * md, size_t outlen);
|
||||
int blake2s_process(hash_state * md, const unsigned char *in, unsigned long inlen);
|
||||
int blake2s_done(hash_state * md, unsigned char *hash);
|
||||
#endif
|
||||
|
||||
|
||||
#ifdef LTC_MD5
|
||||
int md5_init(hash_state * md);
|
||||
int md5_process(hash_state * md, const unsigned char *in, unsigned long inlen);
|
||||
|
||||
Loading…
Reference in New Issue
Block a user