openbsd/src
1
0
Fork 0
mirror of https://github.com/openbsd/src.git synced 2026-06-18 07:13:36 +02:00
Code Activity

Replace the existing SHA-1 implementation in libc.

Browse Source 
This leverages some of the recent code in libcrypto while retaining the
existing API and reusing SHA1_CTX definitions. The implementation uses
static inline functions instead of macros and spells out the full variable
rotations to follow the specification, rather than trying to outsmart the
compiler. A performance gain is seen across most architectures.

This also gives us a basis to provide per-architecture accelerated assembly
implementations, based on those in libcrypto.

With input from naddy@

ok naddy@ tb@
This commit is contained in:
jsing
2026-06-01 13:27:24 +00:00
parent 3294be8cfe
commit 8365e4bb7a
2 changed files with 431 additions and 146 deletions
Download Patch File Download Diff File Expand all files Collapse all files
lib/libc/hash/sha1.c
+424 -144
View File
@@ -1,182 +1,462 @@
/* $OpenBSD: sha1.c,v 1.28 2025/04/14 18:32:24 claudio Exp $ */
/* $OpenBSD: sha1.c,v 1.29 2026/06/01 13:27:24 jsing Exp $ */
/*
* SHA-1 in C
* By Steve Reid <steve@edmweb.com>
* 100% Public Domain
* Copyright (c) 2024, 2026 Joel Sing <jsing@openbsd.org>
*
* Test Vectors (from FIPS PUB 180-1)
* "abc"
* A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
* "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
* 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
* A million repetitions of "a"
* 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <endian.h>
#include <stddef.h>
#include <stdint.h>
#include <string.h>
#include <sha1.h>
#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
/*
* blk0() and blk() perform the initial expand.
* I got the idea of expanding during the round function from SSLeay
*/
#if BYTE_ORDER == LITTLE_ENDIAN
# define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
|(rol(block->l[i],8)&0x00FF00FF))
#else
# define blk0(i) block->l[i]
#endif
#define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
^block->l[(i+2)&15]^block->l[i&15],1))
/*
* (R0+R1), R2, R3, R4 are the different operations (rounds) used in SHA1
*/
#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
#define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
#define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
typedef union {
u_int8_t c[64];
u_int32_t l[16];
} CHAR64LONG16;
/*
* Hash a single 512-bit block. This is the core of the algorithm.
*/
void
SHA1Transform(u_int32_t state[5], const u_int8_t buffer[SHA1_BLOCK_LENGTH])
static inline void
crypto_store_htobe32(uint8_t *dst, uint32_t v)
{
u_int32_t a, b, c, d, e;
u_int8_t workspace[SHA1_BLOCK_LENGTH];
CHAR64LONG16 *block = (CHAR64LONG16 *)workspace;
(void)memcpy(block, buffer, SHA1_BLOCK_LENGTH);
/* Copy context->state[] to working vars */
a = state[0];
b = state[1];
c = state[2];
d = state[3];
e = state[4];
/* 4 rounds of 20 operations each. Loop unrolled. */
R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3);
R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7);
R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11);
R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15);
R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);
R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23);
R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27);
R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31);
R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35);
R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39);
R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43);
R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47);
R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51);
R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55);
R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59);
R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63);
R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67);
R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71);
R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75);
R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79);
/* Add the working vars back into context.state[] */
state[0] += a;
state[1] += b;
state[2] += c;
state[3] += d;
state[4] += e;
/* Wipe variables */
a = b = c = d = e = 0;
v = htobe32(v);
memcpy(dst, &v, sizeof(v));
}
DEF_WEAK(SHA1Transform);
/*
* SHA1Init - Initialize new context
*/
void
SHA1Init(SHA1_CTX *context)
static inline void
crypto_store_htobe64(uint8_t *dst, uint64_t v)
{
v = htobe64(v);
memcpy(dst, &v, sizeof(v));
}
/* SHA1 initialization constants */
context->count = 0;
context->state[0] = 0x67452301;
context->state[1] = 0xEFCDAB89;
context->state[2] = 0x98BADCFE;
context->state[3] = 0x10325476;
context->state[4] = 0xC3D2E1F0;
#ifndef HAVE_SHA1_BLOCK_GENERIC
static inline uint32_t
crypto_load_be32toh(const uint8_t *src)
{
uint32_t v;
memcpy(&v, src, sizeof(v));
return be32toh(v);
}
static inline uint32_t
crypto_rol_u32(uint32_t v, size_t shift)
{
return (v << shift) | (v >> (32 - shift));
}
static inline uint32_t
Ch(uint32_t x, uint32_t y, uint32_t z)
{
return (x & y) ^ (~x & z);
}
static inline uint32_t
Parity(uint32_t x, uint32_t y, uint32_t z)
{
return x ^ y ^ z;
}
static inline uint32_t
Maj(uint32_t x, uint32_t y, uint32_t z)
{
return (x & y) ^ (x & z) ^ (y & z);
}
static inline void
sha1_msg_schedule_update(uint32_t *W0, uint32_t W2, uint32_t W8, uint32_t W13)
{
*W0 = crypto_rol_u32(W13 ^ W8 ^ W2 ^ *W0, 1);
}
static inline void
sha1_round1(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e,
uint32_t Wt)
{
uint32_t Kt, T;
Kt = 0x5a827999UL;
T = crypto_rol_u32(*a, 5) + Ch(*b, *c, *d) + *e + Kt + Wt;
*e = *d;
*d = *c;
*c = crypto_rol_u32(*b, 30);
*b = *a;
*a = T;
}
static inline void
sha1_round2(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e,
uint32_t Wt)
{
uint32_t Kt, T;
Kt = 0x6ed9eba1UL;
T = crypto_rol_u32(*a, 5) + Parity(*b, *c, *d) + *e + Kt + Wt;
*e = *d;
*d = *c;
*c = crypto_rol_u32(*b, 30);
*b = *a;
*a = T;
}
static inline void
sha1_round3(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e,
uint32_t Wt)
{
uint32_t Kt, T;
Kt = 0x8f1bbcdcUL;
T = crypto_rol_u32(*a, 5) + Maj(*b, *c, *d) + *e + Kt + Wt;
*e = *d;
*d = *c;
*c = crypto_rol_u32(*b, 30);
*b = *a;
*a = T;
}
static inline void
sha1_round4(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e,
uint32_t Wt)
{
uint32_t Kt, T;
Kt = 0xca62c1d6UL;
T = crypto_rol_u32(*a, 5) + Parity(*b, *c, *d) + *e + Kt + Wt;
*e = *d;
*d = *c;
*c = crypto_rol_u32(*b, 30);
*b = *a;
*a = T;
}
void
__sha1_block_generic(uint32_t state[5], const uint8_t *in, size_t num)
{
const uint32_t *in32;
uint32_t a, b, c, d, e;
uint32_t W[16];
while (num-- > 0) {
a = state[0];
b = state[1];
c = state[2];
d = state[3];
e = state[4];
if ((size_t)in % 4 == 0) {
/* Input is 32 bit aligned. */
in32 = (const uint32_t *)in;
W[0] = be32toh(in32[0]);
W[1] = be32toh(in32[1]);
W[2] = be32toh(in32[2]);
W[3] = be32toh(in32[3]);
W[4] = be32toh(in32[4]);
W[5] = be32toh(in32[5]);
W[6] = be32toh(in32[6]);
W[7] = be32toh(in32[7]);
W[8] = be32toh(in32[8]);
W[9] = be32toh(in32[9]);
W[10] = be32toh(in32[10]);
W[11] = be32toh(in32[11]);
W[12] = be32toh(in32[12]);
W[13] = be32toh(in32[13]);
W[14] = be32toh(in32[14]);
W[15] = be32toh(in32[15]);
} else {
/* Input is not 32 bit aligned. */
W[0] = crypto_load_be32toh(&in[0 * 4]);
W[1] = crypto_load_be32toh(&in[1 * 4]);
W[2] = crypto_load_be32toh(&in[2 * 4]);
W[3] = crypto_load_be32toh(&in[3 * 4]);
W[4] = crypto_load_be32toh(&in[4 * 4]);
W[5] = crypto_load_be32toh(&in[5 * 4]);
W[6] = crypto_load_be32toh(&in[6 * 4]);
W[7] = crypto_load_be32toh(&in[7 * 4]);
W[8] = crypto_load_be32toh(&in[8 * 4]);
W[9] = crypto_load_be32toh(&in[9 * 4]);
W[10] = crypto_load_be32toh(&in[10 * 4]);
W[11] = crypto_load_be32toh(&in[11 * 4]);
W[12] = crypto_load_be32toh(&in[12 * 4]);
W[13] = crypto_load_be32toh(&in[13 * 4]);
W[14] = crypto_load_be32toh(&in[14 * 4]);
W[15] = crypto_load_be32toh(&in[15 * 4]);
}
in += SHA1_BLOCK_LENGTH;
sha1_round1(&a, &b, &c, &d, &e, W[0]);
sha1_round1(&a, &b, &c, &d, &e, W[1]);
sha1_round1(&a, &b, &c, &d, &e, W[2]);
sha1_round1(&a, &b, &c, &d, &e, W[3]);
sha1_round1(&a, &b, &c, &d, &e, W[4]);
sha1_round1(&a, &b, &c, &d, &e, W[5]);
sha1_round1(&a, &b, &c, &d, &e, W[6]);
sha1_round1(&a, &b, &c, &d, &e, W[7]);
sha1_round1(&a, &b, &c, &d, &e, W[8]);
sha1_round1(&a, &b, &c, &d, &e, W[9]);
sha1_round1(&a, &b, &c, &d, &e, W[10]);
sha1_round1(&a, &b, &c, &d, &e, W[11]);
sha1_round1(&a, &b, &c, &d, &e, W[12]);
sha1_round1(&a, &b, &c, &d, &e, W[13]);
sha1_round1(&a, &b, &c, &d, &e, W[14]);
sha1_round1(&a, &b, &c, &d, &e, W[15]);
sha1_msg_schedule_update(&W[0], W[2], W[8], W[13]);
sha1_msg_schedule_update(&W[1], W[3], W[9], W[14]);
sha1_msg_schedule_update(&W[2], W[4], W[10], W[15]);
sha1_msg_schedule_update(&W[3], W[5], W[11], W[0]);
sha1_msg_schedule_update(&W[4], W[6], W[12], W[1]);
sha1_msg_schedule_update(&W[5], W[7], W[13], W[2]);
sha1_msg_schedule_update(&W[6], W[8], W[14], W[3]);
sha1_msg_schedule_update(&W[7], W[9], W[15], W[4]);
sha1_msg_schedule_update(&W[8], W[10], W[0], W[5]);
sha1_msg_schedule_update(&W[9], W[11], W[1], W[6]);
sha1_msg_schedule_update(&W[10], W[12], W[2], W[7]);
sha1_msg_schedule_update(&W[11], W[13], W[3], W[8]);
sha1_msg_schedule_update(&W[12], W[14], W[4], W[9]);
sha1_msg_schedule_update(&W[13], W[15], W[5], W[10]);
sha1_msg_schedule_update(&W[14], W[0], W[6], W[11]);
sha1_msg_schedule_update(&W[15], W[1], W[7], W[12]);
sha1_round1(&a, &b, &c, &d, &e, W[0]);
sha1_round1(&a, &b, &c, &d, &e, W[1]);
sha1_round1(&a, &b, &c, &d, &e, W[2]);
sha1_round1(&a, &b, &c, &d, &e, W[3]);
sha1_round2(&a, &b, &c, &d, &e, W[4]);
sha1_round2(&a, &b, &c, &d, &e, W[5]);
sha1_round2(&a, &b, &c, &d, &e, W[6]);
sha1_round2(&a, &b, &c, &d, &e, W[7]);
sha1_round2(&a, &b, &c, &d, &e, W[8]);
sha1_round2(&a, &b, &c, &d, &e, W[9]);
sha1_round2(&a, &b, &c, &d, &e, W[10]);
sha1_round2(&a, &b, &c, &d, &e, W[11]);
sha1_round2(&a, &b, &c, &d, &e, W[12]);
sha1_round2(&a, &b, &c, &d, &e, W[13]);
sha1_round2(&a, &b, &c, &d, &e, W[14]);
sha1_round2(&a, &b, &c, &d, &e, W[15]);
sha1_msg_schedule_update(&W[0], W[2], W[8], W[13]);
sha1_msg_schedule_update(&W[1], W[3], W[9], W[14]);
sha1_msg_schedule_update(&W[2], W[4], W[10], W[15]);
sha1_msg_schedule_update(&W[3], W[5], W[11], W[0]);
sha1_msg_schedule_update(&W[4], W[6], W[12], W[1]);
sha1_msg_schedule_update(&W[5], W[7], W[13], W[2]);
sha1_msg_schedule_update(&W[6], W[8], W[14], W[3]);
sha1_msg_schedule_update(&W[7], W[9], W[15], W[4]);
sha1_msg_schedule_update(&W[8], W[10], W[0], W[5]);
sha1_msg_schedule_update(&W[9], W[11], W[1], W[6]);
sha1_msg_schedule_update(&W[10], W[12], W[2], W[7]);
sha1_msg_schedule_update(&W[11], W[13], W[3], W[8]);
sha1_msg_schedule_update(&W[12], W[14], W[4], W[9]);
sha1_msg_schedule_update(&W[13], W[15], W[5], W[10]);
sha1_msg_schedule_update(&W[14], W[0], W[6], W[11]);
sha1_msg_schedule_update(&W[15], W[1], W[7], W[12]);
sha1_round2(&a, &b, &c, &d, &e, W[0]);
sha1_round2(&a, &b, &c, &d, &e, W[1]);
sha1_round2(&a, &b, &c, &d, &e, W[2]);
sha1_round2(&a, &b, &c, &d, &e, W[3]);
sha1_round2(&a, &b, &c, &d, &e, W[4]);
sha1_round2(&a, &b, &c, &d, &e, W[5]);
sha1_round2(&a, &b, &c, &d, &e, W[6]);
sha1_round2(&a, &b, &c, &d, &e, W[7]);
sha1_round3(&a, &b, &c, &d, &e, W[8]);
sha1_round3(&a, &b, &c, &d, &e, W[9]);
sha1_round3(&a, &b, &c, &d, &e, W[10]);
sha1_round3(&a, &b, &c, &d, &e, W[11]);
sha1_round3(&a, &b, &c, &d, &e, W[12]);
sha1_round3(&a, &b, &c, &d, &e, W[13]);
sha1_round3(&a, &b, &c, &d, &e, W[14]);
sha1_round3(&a, &b, &c, &d, &e, W[15]);
sha1_msg_schedule_update(&W[0], W[2], W[8], W[13]);
sha1_msg_schedule_update(&W[1], W[3], W[9], W[14]);
sha1_msg_schedule_update(&W[2], W[4], W[10], W[15]);
sha1_msg_schedule_update(&W[3], W[5], W[11], W[0]);
sha1_msg_schedule_update(&W[4], W[6], W[12], W[1]);
sha1_msg_schedule_update(&W[5], W[7], W[13], W[2]);
sha1_msg_schedule_update(&W[6], W[8], W[14], W[3]);
sha1_msg_schedule_update(&W[7], W[9], W[15], W[4]);
sha1_msg_schedule_update(&W[8], W[10], W[0], W[5]);
sha1_msg_schedule_update(&W[9], W[11], W[1], W[6]);
sha1_msg_schedule_update(&W[10], W[12], W[2], W[7]);
sha1_msg_schedule_update(&W[11], W[13], W[3], W[8]);
sha1_msg_schedule_update(&W[12], W[14], W[4], W[9]);
sha1_msg_schedule_update(&W[13], W[15], W[5], W[10]);
sha1_msg_schedule_update(&W[14], W[0], W[6], W[11]);
sha1_msg_schedule_update(&W[15], W[1], W[7], W[12]);
sha1_round3(&a, &b, &c, &d, &e, W[0]);
sha1_round3(&a, &b, &c, &d, &e, W[1]);
sha1_round3(&a, &b, &c, &d, &e, W[2]);
sha1_round3(&a, &b, &c, &d, &e, W[3]);
sha1_round3(&a, &b, &c, &d, &e, W[4]);
sha1_round3(&a, &b, &c, &d, &e, W[5]);
sha1_round3(&a, &b, &c, &d, &e, W[6]);
sha1_round3(&a, &b, &c, &d, &e, W[7]);
sha1_round3(&a, &b, &c, &d, &e, W[8]);
sha1_round3(&a, &b, &c, &d, &e, W[9]);
sha1_round3(&a, &b, &c, &d, &e, W[10]);
sha1_round3(&a, &b, &c, &d, &e, W[11]);
sha1_round4(&a, &b, &c, &d, &e, W[12]);
sha1_round4(&a, &b, &c, &d, &e, W[13]);
sha1_round4(&a, &b, &c, &d, &e, W[14]);
sha1_round4(&a, &b, &c, &d, &e, W[15]);
sha1_msg_schedule_update(&W[0], W[2], W[8], W[13]);
sha1_msg_schedule_update(&W[1], W[3], W[9], W[14]);
sha1_msg_schedule_update(&W[2], W[4], W[10], W[15]);
sha1_msg_schedule_update(&W[3], W[5], W[11], W[0]);
sha1_msg_schedule_update(&W[4], W[6], W[12], W[1]);
sha1_msg_schedule_update(&W[5], W[7], W[13], W[2]);
sha1_msg_schedule_update(&W[6], W[8], W[14], W[3]);
sha1_msg_schedule_update(&W[7], W[9], W[15], W[4]);
sha1_msg_schedule_update(&W[8], W[10], W[0], W[5]);
sha1_msg_schedule_update(&W[9], W[11], W[1], W[6]);
sha1_msg_schedule_update(&W[10], W[12], W[2], W[7]);
sha1_msg_schedule_update(&W[11], W[13], W[3], W[8]);
sha1_msg_schedule_update(&W[12], W[14], W[4], W[9]);
sha1_msg_schedule_update(&W[13], W[15], W[5], W[10]);
sha1_msg_schedule_update(&W[14], W[0], W[6], W[11]);
sha1_msg_schedule_update(&W[15], W[1], W[7], W[12]);
sha1_round4(&a, &b, &c, &d, &e, W[0]);
sha1_round4(&a, &b, &c, &d, &e, W[1]);
sha1_round4(&a, &b, &c, &d, &e, W[2]);
sha1_round4(&a, &b, &c, &d, &e, W[3]);
sha1_round4(&a, &b, &c, &d, &e, W[4]);
sha1_round4(&a, &b, &c, &d, &e, W[5]);
sha1_round4(&a, &b, &c, &d, &e, W[6]);
sha1_round4(&a, &b, &c, &d, &e, W[7]);
sha1_round4(&a, &b, &c, &d, &e, W[8]);
sha1_round4(&a, &b, &c, &d, &e, W[9]);
sha1_round4(&a, &b, &c, &d, &e, W[10]);
sha1_round4(&a, &b, &c, &d, &e, W[11]);
sha1_round4(&a, &b, &c, &d, &e, W[12]);
sha1_round4(&a, &b, &c, &d, &e, W[13]);
sha1_round4(&a, &b, &c, &d, &e, W[14]);
sha1_round4(&a, &b, &c, &d, &e, W[15]);
state[0] += a;
state[1] += b;
state[2] += c;
state[3] += d;
state[4] += e;
}
}
#endif
#ifndef HAVE_SHA1_BLOCK
void
__sha1_block(uint32_t state[5], const uint8_t *in, size_t num)
{
__sha1_block_generic(state, in, num);
}
#endif
void
SHA1Init(SHA1_CTX *ctx)
{
memset(ctx, 0, sizeof(*ctx));
/* FIPS 180-4 section 5.3.1. */
ctx->state[0] = 0x67452301UL;
ctx->state[1] = 0xefcdab89UL;
ctx->state[2] = 0x98badcfeUL;
ctx->state[3] = 0x10325476UL;
ctx->state[4] = 0xc3d2e1f0UL;
}
DEF_WEAK(SHA1Init);
/*
* Run your data through this.
*/
void
SHA1Update(SHA1_CTX *context, const u_int8_t *data, size_t len)
SHA1Transform(uint32_t state[5], const uint8_t data[SHA1_BLOCK_LENGTH])
{
size_t i, j;
__sha1_block(state, data, 1);
}
DEF_WEAK(SHA1Transform);
void
SHA1Update(SHA1_CTX *ctx, const uint8_t *data, size_t len)
{
size_t blocks, m, n;
/* Calling with no data is valid (we do nothing) */
if (len == 0)
return;
j = (size_t)((context->count >> 3) & 63);
context->count += ((u_int64_t)len << 3);
if ((j + len) > 63) {
(void)memcpy(&context->buffer[j], data, (i = 64-j));
SHA1Transform(context->state, context->buffer);
for ( ; i + 63 < len; i += 64)
SHA1Transform(context->state, (u_int8_t *)&data[i]);
j = 0;
} else {
i = 0;
n = (ctx->count >> 3) % SHA1_BLOCK_LENGTH;
ctx->count += (uint64_t)len << 3;
if (n > 0) {
if ((m = SHA1_BLOCK_LENGTH - n) > len)
m = len;
memcpy(&ctx->buffer[n], data, m);
data += m;
len -= m;
if (n + m == SHA1_BLOCK_LENGTH) {
__sha1_block(ctx->state, ctx->buffer, 1);
memset(ctx->buffer, 0, sizeof(ctx->buffer));
}
}
(void)memcpy(&context->buffer[j], &data[i], len - i);
if (len >= SHA1_BLOCK_LENGTH) {
blocks = len / SHA1_BLOCK_LENGTH;
__sha1_block(ctx->state, data, blocks);
data += blocks * SHA1_BLOCK_LENGTH;
len -= blocks * SHA1_BLOCK_LENGTH;
}
if (len > 0)
memcpy(ctx->buffer, data, len);
}
DEF_WEAK(SHA1Update);
/*
* Add padding and return the message digest.
*/
void
SHA1Pad(SHA1_CTX *context)
SHA1Pad(SHA1_CTX *ctx)
{
u_int8_t finalcount[8];
u_int i;
size_t n;
for (i = 0; i < 8; i++) {
finalcount[i] = (u_int8_t)((context->count >>
((7 - (i & 7)) * 8)) & 255); /* Endian independent */
n = (ctx->count >> 3) % SHA1_BLOCK_LENGTH;
ctx->buffer[n++] = 0x80;
if ((SHA1_BLOCK_LENGTH - n) < 8) {
__sha1_block(ctx->state, ctx->buffer, 1);
memset(ctx->buffer, 0, sizeof(ctx->buffer));
}
SHA1Update(context, (u_int8_t *)"\200", 1);
while ((context->count & 504) != 448)
SHA1Update(context, (u_int8_t *)"\0", 1);
SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */
crypto_store_htobe64(&ctx->buffer[SHA1_BLOCK_LENGTH - 8],
ctx->count);
__sha1_block(ctx->state, ctx->buffer, 1);
memset(ctx->buffer, 0, sizeof(ctx->buffer));
ctx->count = 0;
}
DEF_WEAK(SHA1Pad);
void
SHA1Final(u_int8_t digest[SHA1_DIGEST_LENGTH], SHA1_CTX *context)
SHA1Final(uint8_t digest[SHA1_DIGEST_LENGTH], SHA1_CTX *ctx)
{
u_int i;
int i;
SHA1Pad(context);
for (i = 0; i < SHA1_DIGEST_LENGTH; i++) {
digest[i] = (u_int8_t)
((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
}
explicit_bzero(context, sizeof(*context));
SHA1Pad(ctx);
for (i = 0; i < SHA1_DIGEST_LENGTH / 4; i++)
crypto_store_htobe32(&digest[i * 4], ctx->state[i]);
explicit_bzero(ctx, sizeof(*ctx));
}
DEF_WEAK(SHA1Final);
lib/libc/hidden/sha1.h
+7 -2
View File
@@ -1,4 +1,4 @@
/* $OpenBSD: sha1.h,v 1.1 2015/09/11 09:18:27 guenther Exp $ */
/* $OpenBSD: sha1.h,v 1.2 2026/06/01 13:27:24 jsing Exp $ */
/*
* Copyright (c) 2015 Philip Guenther <guenther@openbsd.org>
*
@@ -14,13 +14,18 @@
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
/* $OpenBSD: sha1.h,v 1.1 2015/09/11 09:18:27 guenther Exp $ */
/* $OpenBSD: sha1.h,v 1.2 2026/06/01 13:27:24 jsing Exp $ */
#ifndef _LIBC_SHA1_H
#define _LIBC_SHA1_H
#include_next <sha1.h>
__BEGIN_HIDDEN_DECLS
void __sha1_block(uint32_t state[5], const uint8_t *in, size_t num);
void __sha1_block_generic(uint32_t state[5], const uint8_t *in, size_t num);
__END_HIDDEN_DECLS
PROTO_NORMAL(SHA1Data);
PROTO_NORMAL(SHA1End);
PROTO_NORMAL(SHA1File);