[PATCH] Add SM3 secure hash algorithm
Tianjia Zhang
tianjia.zhang at linux.alibaba.com
Tue Aug 6 21:50:51 AEST 2024
Add OSCCA SM3 secure hash algorithm (OSCCA GM/T 0004-2012 SM3).
---
Makefile.in | 2 +-
configure.ac | 2 +-
digest-libc.c | 11 ++
digest-openssl.c | 1 +
digest.h | 3 +-
mac.c | 1 +
sm3.c | 320 +++++++++++++++++++++++++++++++++++++++++++++++
sm3.h | 51 ++++++++
8 files changed, 388 insertions(+), 3 deletions(-)
create mode 100644 sm3.c
create mode 100644 sm3.h
diff --git a/Makefile.in b/Makefile.in
index e1b77ebc6495..40bca10cba54 100644
--- a/Makefile.in
+++ b/Makefile.in
@@ -107,7 +107,7 @@ LIBSSH_OBJS=${LIBOPENSSH_OBJS} \
msg.o progressmeter.o dns.o entropy.o gss-genr.o umac.o umac128.o \
ssh-pkcs11.o smult_curve25519_ref.o \
poly1305.o chacha.o cipher-chachapoly.o cipher-chachapoly-libcrypto.o \
- ssh-ed25519.o digest-openssl.o digest-libc.o \
+ ssh-ed25519.o digest-openssl.o digest-libc.o sm3.o \
hmac.o ed25519.o hash.o \
kex.o kex-names.o kexdh.o kexgex.o kexecdh.o kexc25519.o \
kexgexc.o kexgexs.o \
diff --git a/configure.ac b/configure.ac
index 016c96472d15..00bb4132adb7 100644
--- a/configure.ac
+++ b/configure.ac
@@ -3067,7 +3067,7 @@ if test "x$openssl" = "xyes" ; then
)
# Check for various EVP support in OpenSSL
- AC_CHECK_FUNCS([EVP_sha256 EVP_sha384 EVP_sha512 EVP_chacha20])
+ AC_CHECK_FUNCS([EVP_sha256 EVP_sha384 EVP_sha512 EVP_chacha20 EVP_sm3])
# Check complete ECC support in OpenSSL
AC_MSG_CHECKING([whether OpenSSL has NID_X9_62_prime256v1])
diff --git a/digest-libc.c b/digest-libc.c
index 6e77a4492dd4..87aefe0066d8 100644
--- a/digest-libc.c
+++ b/digest-libc.c
@@ -46,6 +46,7 @@
#define SHA512_BLOCK_LENGTH SHA512_HMAC_BLOCK_SIZE
#endif
+#include "sm3.h"
#include "ssherr.h"
#include "sshbuf.h"
#include "digest.h"
@@ -121,6 +122,16 @@ const struct ssh_digest digests[SSH_DIGEST_MAX] = {
(md_init_fn *) SHA512Init,
(md_update_fn *) SHA512Update,
(md_final_fn *) SHA512Final
+ },
+ {
+ SSH_DIGEST_SM3,
+ "SM3",
+ SM3_BLOCK_LENGTH,
+ SM3_DIGEST_LENGTH,
+ sizeof(SM3_CTX),
+ (md_init_fn *) SM3Init,
+ (md_update_fn *) SM3Update,
+ (md_final_fn *) SM3Final
}
};
diff --git a/digest-openssl.c b/digest-openssl.c
index e073a807b148..ad958a84c245 100644
--- a/digest-openssl.c
+++ b/digest-openssl.c
@@ -61,6 +61,7 @@ const struct ssh_digest digests[] = {
{ SSH_DIGEST_SHA256, "SHA256", 32, EVP_sha256 },
{ SSH_DIGEST_SHA384, "SHA384", 48, EVP_sha384 },
{ SSH_DIGEST_SHA512, "SHA512", 64, EVP_sha512 },
+ { SSH_DIGEST_SM3, "SM3", 32, EVP_sm3 },
{ -1, NULL, 0, NULL },
};
diff --git a/digest.h b/digest.h
index 274574d0e544..fdee5ab480ee 100644
--- a/digest.h
+++ b/digest.h
@@ -27,7 +27,8 @@
#define SSH_DIGEST_SHA256 2
#define SSH_DIGEST_SHA384 3
#define SSH_DIGEST_SHA512 4
-#define SSH_DIGEST_MAX 5
+#define SSH_DIGEST_SM3 5
+#define SSH_DIGEST_MAX 6
struct sshbuf;
struct ssh_digest_ctx;
diff --git a/mac.c b/mac.c
index f3dda6692866..dfa02fa0723a 100644
--- a/mac.c
+++ b/mac.c
@@ -63,6 +63,7 @@ static const struct macalg macs[] = {
{ "hmac-sha2-512", SSH_DIGEST, SSH_DIGEST_SHA512, 0, 0, 0, 0 },
{ "hmac-md5", SSH_DIGEST, SSH_DIGEST_MD5, 0, 0, 0, 0 },
{ "hmac-md5-96", SSH_DIGEST, SSH_DIGEST_MD5, 96, 0, 0, 0 },
+ { "hmac-sm3", SSH_DIGEST, SSH_DIGEST_SM3, 0, 0, 0, 0 },
{ "umac-64 at openssh.com", SSH_UMAC, 0, 0, 128, 64, 0 },
{ "umac-128 at openssh.com", SSH_UMAC128, 0, 0, 128, 128, 0 },
diff --git a/sm3.c b/sm3.c
new file mode 100644
index 000000000000..61d733334c6f
--- /dev/null
+++ b/sm3.c
@@ -0,0 +1,320 @@
+/*
+ * Copyright (C) 2024 Tianjia Zhang
+ * 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. Neither the name of the author nor the names of other contributors
+ * may be used to endorse or promote products derived from this software
+ * without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS 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 AUTHOR OR 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 "includes.h"
+
+#ifndef WITH_OPENSSL
+
+#include <sys/types.h>
+#include <string.h>
+#include "sm3.h"
+
+/* ENDIAN SPECIFIC COPY MACROS */
+#define BE_8_TO_32(dst, cp) \
+ (dst) = (u_int32_t)(cp)[3] | ((u_int32_t)(cp)[2] << 8) | \
+ ((u_int32_t)(cp)[1] << 16) | ((u_int32_t)(cp)[0] << 24)
+
+#define BE_64_TO_8(cp, src) do { \
+ (cp)[0] = (src) >> 56; \
+ (cp)[1] = (src) >> 48; \
+ (cp)[2] = (src) >> 40; \
+ (cp)[3] = (src) >> 32; \
+ (cp)[4] = (src) >> 24; \
+ (cp)[5] = (src) >> 16; \
+ (cp)[6] = (src) >> 8; \
+ (cp)[7] = (src); \
+} while (0)
+
+#define BE_32_TO_8(cp, src) do { \
+ (cp)[0] = (src) >> 24; \
+ (cp)[1] = (src) >> 16; \
+ (cp)[2] = (src) >> 8; \
+ (cp)[3] = (src); \
+} while (0)
+
+/* Hash constant words K for SM3: */
+static const u_int32_t K[64] = {
+ 0x79cc4519, 0xf3988a32, 0xe7311465, 0xce6228cb,
+ 0x9cc45197, 0x3988a32f, 0x7311465e, 0xe6228cbc,
+ 0xcc451979, 0x988a32f3, 0x311465e7, 0x6228cbce,
+ 0xc451979c, 0x88a32f39, 0x11465e73, 0x228cbce6,
+ 0x9d8a7a87, 0x3b14f50f, 0x7629ea1e, 0xec53d43c,
+ 0xd8a7a879, 0xb14f50f3, 0x629ea1e7, 0xc53d43ce,
+ 0x8a7a879d, 0x14f50f3b, 0x29ea1e76, 0x53d43cec,
+ 0xa7a879d8, 0x4f50f3b1, 0x9ea1e762, 0x3d43cec5,
+ 0x7a879d8a, 0xf50f3b14, 0xea1e7629, 0xd43cec53,
+ 0xa879d8a7, 0x50f3b14f, 0xa1e7629e, 0x43cec53d,
+ 0x879d8a7a, 0x0f3b14f5, 0x1e7629ea, 0x3cec53d4,
+ 0x79d8a7a8, 0xf3b14f50, 0xe7629ea1, 0xcec53d43,
+ 0x9d8a7a87, 0x3b14f50f, 0x7629ea1e, 0xec53d43c,
+ 0xd8a7a879, 0xb14f50f3, 0x629ea1e7, 0xc53d43ce,
+ 0x8a7a879d, 0x14f50f3b, 0x29ea1e76, 0x53d43cec,
+ 0xa7a879d8, 0x4f50f3b1, 0x9ea1e762, 0x3d43cec5
+};
+
+/*
+ * Transform the message X which consists of 16 32-bit-words. See
+ * GM/T 004-2012 for details.
+ */
+#define ROTL(x, n) ((x << n) | (x >> (32 - n)))
+#define R(i, a, b, c, d, e, f, g, h, t, w1, w2) \
+ do { \
+ ss1 = ROTL((ROTL((a), 12) + (e) + (t)), 7); \
+ ss2 = ss1 ^ ROTL((a), 12); \
+ d += FF_ ## i(a, b, c) + ss2 + ((w1) ^ (w2)); \
+ h += GG_ ## i(e, f, g) + ss1 + (w1); \
+ b = ROTL((b), 9); \
+ f = ROTL((f), 19); \
+ h = P0((h)); \
+ } while (0)
+
+#define R1(a, b, c, d, e, f, g, h, t, w1, w2) \
+ R(1, a, b, c, d, e, f, g, h, t, w1, w2)
+#define R2(a, b, c, d, e, f, g, h, t, w1, w2) \
+ R(2, a, b, c, d, e, f, g, h, t, w1, w2)
+
+#define FF_1(x, y, z) (x ^ y ^ z)
+#define FF_2(x, y, z) ((x & y) | (x & z) | (y & z))
+
+#define GG_1(x, y, z) FF_1(x, y, z)
+#define GG_2(x, y, z) ((x & y) | (~x & z))
+
+/* Message expansion */
+#define P0(x) ((x) ^ ROTL((x), 9) ^ ROTL((x), 17))
+#define P1(x) ((x) ^ ROTL((x), 15) ^ ROTL((x), 23))
+#define I(i) BE_8_TO_32(W[i], data + i * 4)
+#define W1(i) (W[i & 0x0f])
+#define W2(i) (W[i & 0x0f] = \
+ P1(W[i & 0x0f] \
+ ^ W[(i-9) & 0x0f] \
+ ^ ROTL(W[(i-3) & 0x0f], 15)) \
+ ^ ROTL(W[(i-13) & 0x0f], 7) \
+ ^ W[(i-6) & 0x0f])
+
+static void
+SM3Transform(SM3_CTX *ctx, u_int8_t const *data, uint32_t W[16])
+{
+ u_int32_t a, b, c, d, e, f, g, h, ss1, ss2;
+
+ a = ctx->state[0];
+ b = ctx->state[1];
+ c = ctx->state[2];
+ d = ctx->state[3];
+ e = ctx->state[4];
+ f = ctx->state[5];
+ g = ctx->state[6];
+ h = ctx->state[7];
+
+ R1(a, b, c, d, e, f, g, h, K[0], I(0), I(4));
+ R1(d, a, b, c, h, e, f, g, K[1], I(1), I(5));
+ R1(c, d, a, b, g, h, e, f, K[2], I(2), I(6));
+ R1(b, c, d, a, f, g, h, e, K[3], I(3), I(7));
+ R1(a, b, c, d, e, f, g, h, K[4], W1(4), I(8));
+ R1(d, a, b, c, h, e, f, g, K[5], W1(5), I(9));
+ R1(c, d, a, b, g, h, e, f, K[6], W1(6), I(10));
+ R1(b, c, d, a, f, g, h, e, K[7], W1(7), I(11));
+ R1(a, b, c, d, e, f, g, h, K[8], W1(8), I(12));
+ R1(d, a, b, c, h, e, f, g, K[9], W1(9), I(13));
+ R1(c, d, a, b, g, h, e, f, K[10], W1(10), I(14));
+ R1(b, c, d, a, f, g, h, e, K[11], W1(11), I(15));
+ R1(a, b, c, d, e, f, g, h, K[12], W1(12), W2(16));
+ R1(d, a, b, c, h, e, f, g, K[13], W1(13), W2(17));
+ R1(c, d, a, b, g, h, e, f, K[14], W1(14), W2(18));
+ R1(b, c, d, a, f, g, h, e, K[15], W1(15), W2(19));
+
+ R2(a, b, c, d, e, f, g, h, K[16], W1(16), W2(20));
+ R2(d, a, b, c, h, e, f, g, K[17], W1(17), W2(21));
+ R2(c, d, a, b, g, h, e, f, K[18], W1(18), W2(22));
+ R2(b, c, d, a, f, g, h, e, K[19], W1(19), W2(23));
+ R2(a, b, c, d, e, f, g, h, K[20], W1(20), W2(24));
+ R2(d, a, b, c, h, e, f, g, K[21], W1(21), W2(25));
+ R2(c, d, a, b, g, h, e, f, K[22], W1(22), W2(26));
+ R2(b, c, d, a, f, g, h, e, K[23], W1(23), W2(27));
+ R2(a, b, c, d, e, f, g, h, K[24], W1(24), W2(28));
+ R2(d, a, b, c, h, e, f, g, K[25], W1(25), W2(29));
+ R2(c, d, a, b, g, h, e, f, K[26], W1(26), W2(30));
+ R2(b, c, d, a, f, g, h, e, K[27], W1(27), W2(31));
+ R2(a, b, c, d, e, f, g, h, K[28], W1(28), W2(32));
+ R2(d, a, b, c, h, e, f, g, K[29], W1(29), W2(33));
+ R2(c, d, a, b, g, h, e, f, K[30], W1(30), W2(34));
+ R2(b, c, d, a, f, g, h, e, K[31], W1(31), W2(35));
+
+ R2(a, b, c, d, e, f, g, h, K[32], W1(32), W2(36));
+ R2(d, a, b, c, h, e, f, g, K[33], W1(33), W2(37));
+ R2(c, d, a, b, g, h, e, f, K[34], W1(34), W2(38));
+ R2(b, c, d, a, f, g, h, e, K[35], W1(35), W2(39));
+ R2(a, b, c, d, e, f, g, h, K[36], W1(36), W2(40));
+ R2(d, a, b, c, h, e, f, g, K[37], W1(37), W2(41));
+ R2(c, d, a, b, g, h, e, f, K[38], W1(38), W2(42));
+ R2(b, c, d, a, f, g, h, e, K[39], W1(39), W2(43));
+ R2(a, b, c, d, e, f, g, h, K[40], W1(40), W2(44));
+ R2(d, a, b, c, h, e, f, g, K[41], W1(41), W2(45));
+ R2(c, d, a, b, g, h, e, f, K[42], W1(42), W2(46));
+ R2(b, c, d, a, f, g, h, e, K[43], W1(43), W2(47));
+ R2(a, b, c, d, e, f, g, h, K[44], W1(44), W2(48));
+ R2(d, a, b, c, h, e, f, g, K[45], W1(45), W2(49));
+ R2(c, d, a, b, g, h, e, f, K[46], W1(46), W2(50));
+ R2(b, c, d, a, f, g, h, e, K[47], W1(47), W2(51));
+
+ R2(a, b, c, d, e, f, g, h, K[48], W1(48), W2(52));
+ R2(d, a, b, c, h, e, f, g, K[49], W1(49), W2(53));
+ R2(c, d, a, b, g, h, e, f, K[50], W1(50), W2(54));
+ R2(b, c, d, a, f, g, h, e, K[51], W1(51), W2(55));
+ R2(a, b, c, d, e, f, g, h, K[52], W1(52), W2(56));
+ R2(d, a, b, c, h, e, f, g, K[53], W1(53), W2(57));
+ R2(c, d, a, b, g, h, e, f, K[54], W1(54), W2(58));
+ R2(b, c, d, a, f, g, h, e, K[55], W1(55), W2(59));
+ R2(a, b, c, d, e, f, g, h, K[56], W1(56), W2(60));
+ R2(d, a, b, c, h, e, f, g, K[57], W1(57), W2(61));
+ R2(c, d, a, b, g, h, e, f, K[58], W1(58), W2(62));
+ R2(b, c, d, a, f, g, h, e, K[59], W1(59), W2(63));
+ R2(a, b, c, d, e, f, g, h, K[60], W1(60), W2(64));
+ R2(d, a, b, c, h, e, f, g, K[61], W1(61), W2(65));
+ R2(c, d, a, b, g, h, e, f, K[62], W1(62), W2(66));
+ R2(b, c, d, a, f, g, h, e, K[63], W1(63), W2(67));
+
+ ctx->state[0] ^= a;
+ ctx->state[1] ^= b;
+ ctx->state[2] ^= c;
+ ctx->state[3] ^= d;
+ ctx->state[4] ^= e;
+ ctx->state[5] ^= f;
+ ctx->state[6] ^= g;
+ ctx->state[7] ^= h;
+}
+#undef R
+#undef R1
+#undef R2
+#undef I
+#undef W1
+#undef W2
+
+static void
+SM3Block(SM3_CTX *ctx, u_int8_t const *data, size_t blocks, u_int32_t W[16])
+{
+ while (blocks--) {
+ SM3Transform(ctx, data, W);
+ data += SM3_BLOCK_LENGTH;
+ }
+}
+
+
+void
+SM3Init(SM3_CTX *ctx)
+{
+ ctx->state[0] = 0x7380166f;
+ ctx->state[1] = 0x4914b2b9;
+ ctx->state[2] = 0x172442d7;
+ ctx->state[3] = 0xda8a0600;
+ ctx->state[4] = 0xa96f30bc;
+ ctx->state[5] = 0x163138aa;
+ ctx->state[6] = 0xe38dee4d;
+ ctx->state[7] = 0xb0fb0e4e;
+ ctx->count = 0;
+}
+
+void
+SM3Update(SM3_CTX *ctx, const u_int8_t *in, size_t len)
+{
+ const u_int8_t *data = in;
+ unsigned int partial = ctx->count % SM3_BLOCK_LENGTH;
+ u_int32_t W[16];
+
+ ctx->count += len;
+
+ if ((partial + len) >= SM3_BLOCK_LENGTH) {
+ size_t blocks;
+
+ if (partial) {
+ size_t p = SM3_BLOCK_LENGTH - partial;
+
+ memcpy(ctx->buffer + partial, data, p);
+ data += p;
+ len -= p;
+
+ SM3Block(ctx, ctx->buffer, 1, W);
+ }
+
+ blocks = len / SM3_BLOCK_LENGTH;
+ len %= SM3_BLOCK_LENGTH;
+
+ if (blocks) {
+ SM3Block(ctx, data, blocks, W);
+ data += blocks * SM3_BLOCK_LENGTH;
+ }
+
+ explicit_bzero(W, sizeof(W));
+
+ partial = 0;
+ }
+ if (len)
+ memcpy(ctx->buffer + partial, data, len);
+}
+
+void
+SM3Final(u_int8_t digest[SM3_DIGEST_LENGTH], SM3_CTX *ctx)
+{
+ const unsigned int bit_offset = SM3_BLOCK_LENGTH - sizeof(u_int64_t);
+ unsigned int partial = ctx->count % SM3_BLOCK_LENGTH;
+ u_int32_t W[16];
+ int i;
+
+ ctx->buffer[partial++] = 0x80;
+ if (partial > bit_offset) {
+ memset(ctx->buffer + partial, 0, SM3_BLOCK_LENGTH - partial);
+ partial = 0;
+
+ SM3Block(ctx, ctx->buffer, 1, W);
+ }
+
+ memset(ctx->buffer + partial, 0, bit_offset - partial);
+ BE_64_TO_8(ctx->buffer + bit_offset, ctx->count << 3);
+ SM3Block(ctx, ctx->buffer, 1, W);
+
+ for (i = 0; i < 8; i++)
+ BE_32_TO_8(digest + i * 4, ctx->state[i]);
+
+ /* Zeroize sensitive information. */
+ explicit_bzero(W, sizeof(W));
+ explicit_bzero(ctx, sizeof(*ctx));
+}
+
+void
+SM3Buf(const u_int8_t *in, size_t len, u_int8_t digest[SM3_DIGEST_LENGTH])
+{
+ SM3_CTX ctx;
+
+ SM3Init(&ctx);
+ SM3Update(&ctx, in, len);
+ SM3Final(digest, &ctx);
+
+ explicit_bzero(&ctx, sizeof(ctx));
+}
+
+#endif /* !WITH_OPENSSL */
diff --git a/sm3.h b/sm3.h
new file mode 100644
index 000000000000..698dd548e894
--- /dev/null
+++ b/sm3.h
@@ -0,0 +1,51 @@
+/*
+ * Copyright (C) 2024 Tianjia Zhang
+ * 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. Neither the name of the author nor the names of other contributors
+ * may be used to endorse or promote products derived from this software
+ * without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS 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 AUTHOR OR 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.
+ */
+
+#ifndef _SM3_H_
+#define _SM3_H_
+
+#ifndef WITH_OPENSSL
+
+#define SM3_BLOCK_LENGTH 64
+#define SM3_DIGEST_LENGTH 32
+
+typedef struct SM3Context {
+ u_int32_t state[SM3_DIGEST_LENGTH / 4];
+ u_int64_t count;
+ u_int8_t buffer[SM3_BLOCK_LENGTH];
+} SM3_CTX;
+
+void SM3Init(SM3_CTX *);
+void SM3Update(SM3_CTX *, const u_int8_t *, size_t);
+void SM3Final(u_int8_t[SM3_DIGEST_LENGTH], SM3_CTX *);
+void SM3Buf(const u_int8_t *, size_t, u_int8_t[SM3_DIGEST_LENGTH]);
+
+#endif /* !WITH_OPENSSL */
+
+#endif /* !_SM3_H_ */
--
2.39.3 (Apple Git-146)
More information about the openssh-unix-dev
mailing list