Lucas/lilcrypto
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Rename *_CHUNK* to *_BLOCKLEN*

Browse Source
This commit is contained in:
Lucas Gabriel Vuotto 2024-06-09 14:05:52 +00:00
parent 62eb1ea6f8
commit 06e9c5ec67
13 changed files with 77 additions and 74 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
aead_chacha20_poly1305.c
View File

@ -67,8 +67,8 @@ chacha20_poly1305_seal(uint8_t *out, size_t *outlen, const void *initparams,
inlen > SIZE_MAX - LC_POLY1305_TAGLEN) inlen > SIZE_MAX - LC_POLY1305_TAGLEN)
return 0; return 0;
/* Counter 0 is used for deriving Poly1305 key. */ /* Counter 0 is used for deriving Poly1305 key. */
if (inlen > SIZE_MAX - (CHACHA20_CHUNK - 1) || if (inlen > SIZE_MAX - (CHACHA20_BLOCKLEN - 1) ||
(inlen + CHACHA20_CHUNK - 1) / CHACHA20_CHUNK > (inlen + CHACHA20_BLOCKLEN - 1) / CHACHA20_BLOCKLEN >
CHACHA20_CTRMAX - 1) CHACHA20_CTRMAX - 1)
return 0; return 0;
@ -156,8 +156,8 @@ xchacha20_poly1305_seal(uint8_t *out, size_t *outlen, const void *initparams,
inlen > SIZE_MAX - LC_POLY1305_TAGLEN) inlen > SIZE_MAX - LC_POLY1305_TAGLEN)
return 0; return 0;
/* Counter 0 is used for deriving Poly1305 key. */ /* Counter 0 is used for deriving Poly1305 key. */
if (inlen > SIZE_MAX - (CHACHA20_CHUNK - 1) || if (inlen > SIZE_MAX - (CHACHA20_BLOCKLEN - 1) ||
(inlen + CHACHA20_CHUNK - 1) / CHACHA20_CHUNK > (inlen + CHACHA20_BLOCKLEN - 1) / CHACHA20_BLOCKLEN >
CHACHA20_CTRMAX - 1) CHACHA20_CTRMAX - 1)
return 0; return 0;
@ -246,8 +246,8 @@ chacha20_poly1305_open(uint8_t *out, size_t *outlen, const void *initparams,
inlen > UINT64_MAX || aadlen > UINT64_MAX) inlen > UINT64_MAX || aadlen > UINT64_MAX)
return 0; return 0;
/* Counter 0 is used for deriving Poly1305 key. */ /* Counter 0 is used for deriving Poly1305 key. */
if (inlen > SIZE_MAX - (CHACHA20_CHUNK - 1) || if (inlen > SIZE_MAX - (CHACHA20_BLOCKLEN - 1) ||
(inlen + CHACHA20_CHUNK - 1) / CHACHA20_CHUNK > (inlen + CHACHA20_BLOCKLEN - 1) / CHACHA20_BLOCKLEN >
CHACHA20_CTRMAX - 1) { CHACHA20_CTRMAX - 1) {
return 0; return 0;
} }
@ -341,8 +341,8 @@ xchacha20_poly1305_open(uint8_t *out, size_t *outlen, const void *initparams,
inlen > UINT64_MAX || aadlen > UINT64_MAX) inlen > UINT64_MAX || aadlen > UINT64_MAX)
return 0; return 0;
/* Counter 0 is used for deriving Poly1305 key. */ /* Counter 0 is used for deriving Poly1305 key. */
if (inlen > SIZE_MAX - (CHACHA20_CHUNK - 1) || if (inlen > SIZE_MAX - (CHACHA20_BLOCKLEN - 1) ||
(inlen + CHACHA20_CHUNK - 1) / CHACHA20_CHUNK > (inlen + CHACHA20_BLOCKLEN - 1) / CHACHA20_BLOCKLEN >
CHACHA20_CTRMAX - 1) { CHACHA20_CTRMAX - 1) {
return 0; return 0;
} }

4
auth_hmac.c
View File

@ -63,7 +63,7 @@ hmac_sha224_sha256_init(void *arg, const void *initparams)
const struct lc_hmac_params *params = initparams; const struct lc_hmac_params *params = initparams;
struct hmac_ctx *ctx = arg; struct hmac_ctx *ctx = arg;
ctx->blocksz = SHA256_CHUNK; ctx->blocksz = SHA256_BLOCKLEN;
return hmac_common_init(ctx, params->key, params->keylen); return hmac_common_init(ctx, params->key, params->keylen);
} }
@ -74,7 +74,7 @@ hmac_sha384_sha512_init(void *arg, const void *initparams)
const struct lc_hmac_params *params = initparams; const struct lc_hmac_params *params = initparams;
struct hmac_ctx *ctx = arg; struct hmac_ctx *ctx = arg;
ctx->blocksz = SHA512_CHUNK; ctx->blocksz = SHA512_BLOCKLEN;
return hmac_common_init(ctx, params->key, params->keylen); return hmac_common_init(ctx, params->key, params->keylen);
} }

18
auth_poly1305.c
View File

@ -59,7 +59,7 @@ poly1305_init(void *arg, const void *initparams)
ctx->s3 = load32le(&params->key[28]); ctx->s3 = load32le(&params->key[28]);
ctx->mlen = 0; ctx->mlen = 0;
for (i = 0; i < POLY1305_CHUNK; i++) for (i = 0; i < POLY1305_BLOCKLEN; i++)
ctx->m[i] = 0; ctx->m[i] = 0;
return 1; return 1;
@ -71,13 +71,13 @@ poly1305_update(void *arg, const uint8_t *in, size_t inlen)
struct poly1305_ctx *ctx = arg; struct poly1305_ctx *ctx = arg;
size_t i; size_t i;
for (i = 0; i + ctx->mlen < POLY1305_CHUNK && i < inlen; i++) for (i = 0; i + ctx->mlen < POLY1305_BLOCKLEN && i < inlen; i++)
ctx->m[i + ctx->mlen] = in[i]; ctx->m[i + ctx->mlen] = in[i];
ctx->mlen += i; ctx->mlen += i;
in += i; in += i;
inlen -= i; inlen -= i;
if (ctx->mlen == POLY1305_CHUNK) { if (ctx->mlen == POLY1305_BLOCKLEN) {
poly1305_block(ctx, 1); poly1305_block(ctx, 1);
ctx->mlen = 0; ctx->mlen = 0;
} }
@ -85,13 +85,13 @@ poly1305_update(void *arg, const uint8_t *in, size_t inlen)
if (inlen == 0) if (inlen == 0)
return 1; return 1;
while (inlen >= POLY1305_CHUNK) { while (inlen >= POLY1305_BLOCKLEN) {
for (i = 0; i < POLY1305_CHUNK; i++) for (i = 0; i < POLY1305_BLOCKLEN; i++)
ctx->m[i] = in[i]; ctx->m[i] = in[i];
poly1305_block(ctx, 1); poly1305_block(ctx, 1);
in += POLY1305_CHUNK; in += POLY1305_BLOCKLEN;
inlen -= POLY1305_CHUNK; inlen -= POLY1305_BLOCKLEN;
} }
for (i = 0; i < inlen; i++) for (i = 0; i < inlen; i++)
@ -114,9 +114,9 @@ poly1305_final(void *arg, uint8_t *out, size_t *outlen)
i = ctx->mlen; i = ctx->mlen;
if (i > 0) { if (i > 0) {
if (i < POLY1305_CHUNK) { if (i < POLY1305_BLOCKLEN) {
ctx->m[i++] = 1; ctx->m[i++] = 1;
for (; i < POLY1305_CHUNK; i++) for (; i < POLY1305_BLOCKLEN; i++)
ctx->m[i] = 0; ctx->m[i] = 0;
poly1305_block(ctx, 0); poly1305_block(ctx, 0);
} else } else

35
cipher_chacha20.c
View File

@ -37,7 +37,7 @@ chacha20_anycrypt_init(void *arg, const void *initparams)
struct chacha20_ctx *ctx = arg; struct chacha20_ctx *ctx = arg;
size_t i; size_t i;
for (i = 0; i < CHACHA20_CHUNK_WORDS; i++) for (i = 0; i < CHACHA20_BLOCKLEN_WORDS; i++)
ctx->s[i] = 0; ctx->s[i] = 0;
for (i = 0; i < CHACHA20_KEY_WORDS; i++) for (i = 0; i < CHACHA20_KEY_WORDS; i++)
ctx->k[i] = load32le(&params->key[i * 4]); ctx->k[i] = load32le(&params->key[i * 4]);
@ -56,7 +56,7 @@ xchacha20_anycrypt_init(void *arg, const void *initparams)
struct chacha20_ctx *ctx = arg; struct chacha20_ctx *ctx = arg;
size_t i; size_t i;
for (i = 0; i < CHACHA20_CHUNK_WORDS; i++) for (i = 0; i < CHACHA20_BLOCKLEN_WORDS; i++)
ctx->s[i] = 0; ctx->s[i] = 0;
for (i = 0; i < CHACHA20_KEY_WORDS; i++) for (i = 0; i < CHACHA20_KEY_WORDS; i++)
ctx->k[i] = load32le(&params->key[i * 4]); ctx->k[i] = load32le(&params->key[i * 4]);
@ -91,50 +91,52 @@ chacha20_anycrypt_update(void *arg, uint8_t *out, size_t *outlen,
uint32_t h; uint32_t h;
*outlen = 0; *outlen = 0;
if (inlen > SIZE_MAX - (CHACHA20_CHUNK - 1) - ctx->mlen) if (inlen > SIZE_MAX - (CHACHA20_BLOCKLEN - 1) - ctx->mlen)
return 0; return 0;
blocks = (inlen + ctx->mlen + CHACHA20_CHUNK - 1) / CHACHA20_CHUNK; blocks = (inlen + ctx->mlen + CHACHA20_BLOCKLEN - 1) /
CHACHA20_BLOCKLEN;
if (blocks + ctx->n[0] > CHACHA20_CTRMAX) if (blocks + ctx->n[0] > CHACHA20_CTRMAX)
return 0; return 0;
*outlen = ctx->mlen + inlen - ((ctx->mlen + inlen) % CHACHA20_CHUNK); *outlen = ctx->mlen + inlen -
((ctx->mlen + inlen) % CHACHA20_BLOCKLEN);
if (out == NULL) if (out == NULL)
return 1; return 1;
for (i = 0; i + ctx->mlen < CHACHA20_CHUNK && i < inlen; i++) for (i = 0; i + ctx->mlen < CHACHA20_BLOCKLEN && i < inlen; i++)
ctx->m[i + ctx->mlen] = in[i]; ctx->m[i + ctx->mlen] = in[i];
ctx->mlen += i; ctx->mlen += i;
in += i; in += i;
inlen -= i; inlen -= i;
if (ctx->mlen == CHACHA20_CHUNK) { if (ctx->mlen == CHACHA20_BLOCKLEN) {
chacha20_block(ctx); chacha20_block(ctx);
ctx->n[0]++; ctx->n[0]++;
for (i = 0; i < CHACHA20_CHUNK_WORDS; i++) { for (i = 0; i < CHACHA20_BLOCKLEN_WORDS; i++) {
h = load32le(&ctx->m[i * 4]); h = load32le(&ctx->m[i * 4]);
h ^= ctx->s[i]; h ^= ctx->s[i];
store32le(&out[i * 4], h); store32le(&out[i * 4], h);
} }
out += CHACHA20_CHUNK; out += CHACHA20_BLOCKLEN;
ctx->mlen = 0; ctx->mlen = 0;
} }
if (inlen == 0) if (inlen == 0)
return 1; return 1;
while (inlen >= CHACHA20_CHUNK) { while (inlen >= CHACHA20_BLOCKLEN) {
chacha20_block(ctx); chacha20_block(ctx);
ctx->n[0]++; ctx->n[0]++;
for (i = 0; i < CHACHA20_CHUNK_WORDS; i++) { for (i = 0; i < CHACHA20_BLOCKLEN_WORDS; i++) {
h = load32le(&in[i * 4]); h = load32le(&in[i * 4]);
h ^= ctx->s[i]; h ^= ctx->s[i];
store32le(&out[i * 4], h); store32le(&out[i * 4], h);
} }
out += CHACHA20_CHUNK; out += CHACHA20_BLOCKLEN;
in += CHACHA20_CHUNK; in += CHACHA20_BLOCKLEN;
inlen -= CHACHA20_CHUNK; inlen -= CHACHA20_BLOCKLEN;
} }
for (i = 0; i < inlen; i++) for (i = 0; i < inlen; i++)
@ -187,8 +189,9 @@ chacha20_anycrypt(uint8_t *out, size_t *outlen, const void *initparams,
*outlen = 0; *outlen = 0;
if (inlen > SIZE_MAX - (CHACHA20_CHUNK - 1) || if (inlen > SIZE_MAX - (CHACHA20_BLOCKLEN - 1) ||
(inlen + CHACHA20_CHUNK - 1) / CHACHA20_CHUNK > CHACHA20_CTRMAX) (inlen + CHACHA20_BLOCKLEN - 1) / CHACHA20_BLOCKLEN >
CHACHA20_CTRMAX)
return 0; return 0;
if (out == NULL) { if (out == NULL) {

18
hash_sha224_sha256.c
View File

@ -71,7 +71,7 @@ sha224_init(void *arg)
ctx->sz = 0; ctx->sz = 0;
ctx->mlen = 0; ctx->mlen = 0;
for (i = 0; i < SHA256_CHUNK; i++) for (i = 0; i < SHA256_BLOCKLEN; i++)
ctx->m[i] = 0; ctx->m[i] = 0;
return 1; return 1;
@ -95,7 +95,7 @@ sha256_init(void *arg)
ctx->sz = 0; ctx->sz = 0;
ctx->mlen = 0; ctx->mlen = 0;
for (i = 0; i < SHA256_CHUNK; i++) for (i = 0; i < SHA256_BLOCKLEN; i++)
ctx->m[i] = 0; ctx->m[i] = 0;
return 1; return 1;
@ -111,13 +111,13 @@ sha224_sha256_update(void *arg, const uint8_t *in, size_t inlen)
return 0; return 0;
ctx->sz += inlen; ctx->sz += inlen;
for (i = 0; i + ctx->mlen < SHA256_CHUNK && i < inlen; i++) for (i = 0; i + ctx->mlen < SHA256_BLOCKLEN && i < inlen; i++)
ctx->m[i + ctx->mlen] = in[i]; ctx->m[i + ctx->mlen] = in[i];
ctx->mlen += i; ctx->mlen += i;
in += i; in += i;
inlen -= i; inlen -= i;
if (ctx->mlen == SHA256_CHUNK) { if (ctx->mlen == SHA256_BLOCKLEN) {
sha256_block(ctx); sha256_block(ctx);
ctx->mlen = 0; ctx->mlen = 0;
} }
@ -125,8 +125,8 @@ sha224_sha256_update(void *arg, const uint8_t *in, size_t inlen)
if (inlen == 0) if (inlen == 0)
return 1; return 1;
while (inlen >= SHA256_CHUNK) { while (inlen >= SHA256_BLOCKLEN) {
for (i = 0; i < SHA256_CHUNK; i++) for (i = 0; i < SHA256_BLOCKLEN; i++)
ctx->m[i] = in[i]; ctx->m[i] = in[i];
in += i; in += i;
inlen -= i; inlen -= i;
@ -161,14 +161,14 @@ sha224_sha256_final(struct sha256_ctx *ctx)
mlen = ctx->mlen; mlen = ctx->mlen;
ctx->m[mlen++] = 0x80; ctx->m[mlen++] = 0x80;
if (mlen >= SHA256_CHUNK - sizeof(uint64_t)) { if (mlen >= SHA256_BLOCKLEN - sizeof(uint64_t)) {
for (i = mlen; i < SHA256_CHUNK; i++) for (i = mlen; i < SHA256_BLOCKLEN; i++)
ctx->m[i] = 0; ctx->m[i] = 0;
sha256_block(ctx); sha256_block(ctx);
mlen = 0; mlen = 0;
} }
for (i = mlen; i < SHA256_CHUNK - sizeof(uint64_t); i++) for (i = mlen; i < SHA256_BLOCKLEN - sizeof(uint64_t); i++)
ctx->m[i] = 0; ctx->m[i] = 0;
store64be(&ctx->m[i], ctx->sz << 3); store64be(&ctx->m[i], ctx->sz << 3);
sha256_block(ctx); sha256_block(ctx);

18
hash_sha384_sha512.c
View File

@ -72,7 +72,7 @@ sha384_init(void *arg)
ctx->szhi = ctx->szlo = 0; ctx->szhi = ctx->szlo = 0;
ctx->mlen = 0; ctx->mlen = 0;
for (i = 0; i < SHA512_CHUNK; i++) for (i = 0; i < SHA512_BLOCKLEN; i++)
ctx->m[i] = 0; ctx->m[i] = 0;
return 1; return 1;
@ -96,7 +96,7 @@ sha512_init(void *arg)
ctx->szhi = ctx->szlo = 0; ctx->szhi = ctx->szlo = 0;
ctx->mlen = 0; ctx->mlen = 0;
for (i = 0; i < SHA512_CHUNK; i++) for (i = 0; i < SHA512_BLOCKLEN; i++)
ctx->m[i] = 0; ctx->m[i] = 0;
return 1; return 1;
@ -116,13 +116,13 @@ sha384_sha512_update(void *arg, const uint8_t *in, size_t inlen)
} else } else
ctx->szlo += inlen; ctx->szlo += inlen;
for (i = 0; i + ctx->mlen < SHA512_CHUNK && i < inlen; i++) for (i = 0; i + ctx->mlen < SHA512_BLOCKLEN && i < inlen; i++)
ctx->m[i + ctx->mlen] = in[i]; ctx->m[i + ctx->mlen] = in[i];
ctx->mlen += i; ctx->mlen += i;
in += i; in += i;
inlen -= i; inlen -= i;
if (ctx->mlen == SHA512_CHUNK) { if (ctx->mlen == SHA512_BLOCKLEN) {
sha512_block(ctx); sha512_block(ctx);
ctx->mlen = 0; ctx->mlen = 0;
} }
@ -130,8 +130,8 @@ sha384_sha512_update(void *arg, const uint8_t *in, size_t inlen)
if (inlen == 0) if (inlen == 0)
return 1; return 1;
while (inlen >= SHA512_CHUNK) { while (inlen >= SHA512_BLOCKLEN) {
for (i = 0; i < SHA512_CHUNK; i++) for (i = 0; i < SHA512_BLOCKLEN; i++)
ctx->m[i] = in[i]; ctx->m[i] = in[i];
in += i; in += i;
inlen -= i; inlen -= i;
@ -166,14 +166,14 @@ sha384_sha512_final(struct sha512_ctx *ctx)
mlen = ctx->mlen; mlen = ctx->mlen;
ctx->m[mlen++] = 0x80; ctx->m[mlen++] = 0x80;
if (mlen >= SHA512_CHUNK - 2 * sizeof(uint64_t)) { if (mlen >= SHA512_BLOCKLEN - 2 * sizeof(uint64_t)) {
for (i = mlen; i < SHA512_CHUNK; i++) for (i = mlen; i < SHA512_BLOCKLEN; i++)
ctx->m[i] = 0; ctx->m[i] = 0;
sha512_block(ctx); sha512_block(ctx);
mlen = 0; mlen = 0;
} }
for (i = mlen; i < SHA512_CHUNK - 2 * sizeof(uint64_t); i++) for (i = mlen; i < SHA512_BLOCKLEN - 2 * sizeof(uint64_t); i++)
ctx->m[i] = 0; ctx->m[i] = 0;
store64be(&ctx->m[i], (ctx->szhi << 3) | (ctx->szlo >> 63)); store64be(&ctx->m[i], (ctx->szhi << 3) | (ctx->szlo >> 63));
store64be(&ctx->m[i + sizeof(uint64_t)], ctx->szlo << 3); store64be(&ctx->m[i + sizeof(uint64_t)], ctx->szlo << 3);

10
impl_chacha20.c
View File

@ -45,7 +45,7 @@
void void
chacha20_block(struct chacha20_ctx *ctx) chacha20_block(struct chacha20_ctx *ctx)
{ {
uint32_t x[CHACHA20_CHUNK_WORDS]; uint32_t x[CHACHA20_BLOCKLEN_WORDS];
size_t i; size_t i;
x[0] = SIGMA0; x[0] = SIGMA0;
@ -65,7 +65,7 @@ chacha20_block(struct chacha20_ctx *ctx)
x[14] = ctx->n[2]; x[14] = ctx->n[2];
x[15] = ctx->n[3]; x[15] = ctx->n[3];
for (i = 0; i < CHACHA20_CHUNK_WORDS; i++) for (i = 0; i < CHACHA20_BLOCKLEN_WORDS; i++)
ctx->s[i] = x[i]; ctx->s[i] = x[i];
for (i = 0; i < CHACHA20_ROUNDS; i++) { for (i = 0; i < CHACHA20_ROUNDS; i++) {
@ -80,14 +80,14 @@ chacha20_block(struct chacha20_ctx *ctx)
QUARTERROUND(x[3], x[4], x[9], x[14]); QUARTERROUND(x[3], x[4], x[9], x[14]);
} }
for (i = 0; i < CHACHA20_CHUNK_WORDS; i++) for (i = 0; i < CHACHA20_BLOCKLEN_WORDS; i++)
ctx->s[i] += x[i]; ctx->s[i] += x[i];
} }
void void
hchacha20_block(struct chacha20_ctx *ctx) hchacha20_block(struct chacha20_ctx *ctx)
{ {
uint32_t x[CHACHA20_CHUNK_WORDS]; uint32_t x[CHACHA20_BLOCKLEN_WORDS];
size_t i; size_t i;
x[0] = SIGMA0; x[0] = SIGMA0;
@ -119,6 +119,6 @@ hchacha20_block(struct chacha20_ctx *ctx)
QUARTERROUND(x[3], x[4], x[9], x[14]); QUARTERROUND(x[3], x[4], x[9], x[14]);
} }
for (i = 0; i < CHACHA20_CHUNK_WORDS; i++) for (i = 0; i < CHACHA20_BLOCKLEN_WORDS; i++)
ctx->s[i] = x[i]; ctx->s[i] = x[i];
} }

8
impl_chacha20.h
View File

@ -20,8 +20,8 @@
#include "lilcrypto.h" #include "lilcrypto.h"
#define CHACHA20_CHUNK 64 #define CHACHA20_BLOCKLEN 64
#define CHACHA20_CHUNK_WORDS (CHACHA20_CHUNK / sizeof(uint32_t)) #define CHACHA20_BLOCKLEN_WORDS (CHACHA20_BLOCKLEN / sizeof(uint32_t))
#define CHACHA20_CTRMAX 4294967295 /* 2^32 - 1 */ #define CHACHA20_CTRMAX 4294967295 /* 2^32 - 1 */
#define CHACHA20_KEY_WORDS (LC_CHACHA20_KEYLEN / sizeof(uint32_t)) #define CHACHA20_KEY_WORDS (LC_CHACHA20_KEYLEN / sizeof(uint32_t))
#define CHACHA20_NONCE_WORDS 4 #define CHACHA20_NONCE_WORDS 4
@ -29,11 +29,11 @@
struct chacha20_ctx { struct chacha20_ctx {
uint32_t s[CHACHA20_CHUNK_WORDS]; uint32_t s[CHACHA20_BLOCKLEN_WORDS];
uint32_t k[CHACHA20_KEY_WORDS]; uint32_t k[CHACHA20_KEY_WORDS];
uint32_t n[CHACHA20_NONCE_WORDS]; uint32_t n[CHACHA20_NONCE_WORDS];
size_t mlen; size_t mlen;
uint8_t m[CHACHA20_CHUNK]; uint8_t m[CHACHA20_BLOCKLEN];
}; };

4
impl_poly1305.h
View File

@ -20,7 +20,7 @@
#include "lilcrypto.h" #include "lilcrypto.h"
#define POLY1305_CHUNK 16 #define POLY1305_BLOCKLEN 16
#define POLY1305_TAGLEN_WORDS (LC_POLY1305_TAGLEN / sizeof(uint32_t)) #define POLY1305_TAGLEN_WORDS (LC_POLY1305_TAGLEN / sizeof(uint32_t))
@ -30,7 +30,7 @@ struct poly1305_ctx {
uint32_t x1, x2, x3, x4; uint32_t x1, x2, x3, x4;
uint32_t s0, s1, s2, s3; uint32_t s0, s1, s2, s3;
size_t mlen; size_t mlen;
uint8_t m[POLY1305_CHUNK]; uint8_t m[POLY1305_BLOCKLEN];
}; };

4
impl_sha256.c
View File

@ -50,11 +50,11 @@ static const uint32_t K[SHA256_ROUNDS] = {
void void
sha256_block(struct sha256_ctx *ctx) sha256_block(struct sha256_ctx *ctx)
{ {
uint32_t m[SHA256_CHUNK_WORDS], W[SHA256_ROUNDS]; uint32_t m[SHA256_BLOCKLEN_WORDS], W[SHA256_ROUNDS];
uint32_t a, b, c, d, e, f, g, h, T1, T2; uint32_t a, b, c, d, e, f, g, h, T1, T2;
size_t i; size_t i;
for (i = 0; i < SHA256_CHUNK_WORDS; i++) for (i = 0; i < SHA256_BLOCKLEN_WORDS; i++)
W[i] = m[i] = load32be(&ctx->m[i * 4]); W[i] = m[i] = load32be(&ctx->m[i * 4]);
for (; i < SHA256_ROUNDS; i++) for (; i < SHA256_ROUNDS; i++)
W[i] = SSIG1(W[i - 2]) + W[i - 7] + SSIG0(W[i - 15]) + W[i] = SSIG1(W[i - 2]) + W[i - 7] + SSIG0(W[i - 15]) +

6
impl_sha256.h
View File

@ -20,8 +20,8 @@
#include "lilcrypto.h" #include "lilcrypto.h"
#define SHA256_CHUNK 64 #define SHA256_BLOCKLEN 64
#define SHA256_CHUNK_WORDS (SHA256_CHUNK / sizeof(uint32_t)) #define SHA256_BLOCKLEN_WORDS (SHA256_BLOCKLEN / sizeof(uint32_t))
#define SHA256_ROUNDS 64 #define SHA256_ROUNDS 64
@ -29,7 +29,7 @@ struct sha256_ctx {
uint32_t h0, h1, h2, h3, h4, h5, h6, h7; uint32_t h0, h1, h2, h3, h4, h5, h6, h7;
uint64_t sz; uint64_t sz;
size_t mlen; size_t mlen;
uint8_t m[SHA256_CHUNK]; uint8_t m[SHA256_BLOCKLEN];
}; };

4
impl_sha512.c
View File

@ -74,11 +74,11 @@ static const uint64_t K[SHA512_ROUNDS] = {
void void
sha512_block(struct sha512_ctx *ctx) sha512_block(struct sha512_ctx *ctx)
{ {
uint64_t m[SHA512_CHUNK_WORDS], W[SHA512_ROUNDS]; uint64_t m[SHA512_BLOCKLEN_WORDS], W[SHA512_ROUNDS];
uint64_t a, b, c, d, e, f, g, h, T1, T2; uint64_t a, b, c, d, e, f, g, h, T1, T2;
size_t i; size_t i;
for (i = 0; i < SHA512_CHUNK_WORDS; i++) for (i = 0; i < SHA512_BLOCKLEN_WORDS; i++)
W[i] = m[i] = load64be(&ctx->m[i * 8]); W[i] = m[i] = load64be(&ctx->m[i * 8]);
for (; i < SHA512_ROUNDS; i++) for (; i < SHA512_ROUNDS; i++)
W[i] = SSIG1(W[i - 2]) + W[i - 7] + SSIG0(W[i - 15]) + W[i] = SSIG1(W[i - 2]) + W[i - 7] + SSIG0(W[i - 15]) +

6
impl_sha512.h
View File

@ -20,8 +20,8 @@
#include "lilcrypto.h" #include "lilcrypto.h"
#define SHA512_CHUNK 128 #define SHA512_BLOCKLEN 128
#define SHA512_CHUNK_WORDS (SHA512_CHUNK / sizeof(uint64_t)) #define SHA512_BLOCKLEN_WORDS (SHA512_BLOCKLEN / sizeof(uint64_t))
#define SHA512_ROUNDS 80 #define SHA512_ROUNDS 80
@ -29,7 +29,7 @@ struct sha512_ctx {
uint64_t h0, h1, h2, h3, h4, h5, h6, h7; uint64_t h0, h1, h2, h3, h4, h5, h6, h7;
uint64_t szhi, szlo; uint64_t szhi, szlo;
size_t mlen; size_t mlen;
uint8_t m[SHA512_CHUNK]; uint8_t m[SHA512_BLOCKLEN];
}; };