mirror of
https://github.com/guanzhi/GmSSL.git
synced 2026-05-06 16:36:16 +08:00
193 lines
3.0 KiB
C
193 lines
3.0 KiB
C
/*
|
|
* Copyright 2014-2024 The GmSSL Project. All Rights Reserved.
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the License); you may
|
|
* not use this file except in compliance with the License.
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*/
|
|
|
|
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <stdlib.h>
|
|
#include <gmssl/hex.h>
|
|
#include <gmssl/gf128.h>
|
|
#include <gmssl/endian.h>
|
|
#include <gmssl/error.h>
|
|
|
|
|
|
static uint64_t reverse_bits(uint64_t a)
|
|
{
|
|
uint64_t r = 0;
|
|
int i;
|
|
|
|
for (i = 0; i < 63; i++) {
|
|
r |= a & 1;
|
|
r <<= 1;
|
|
a >>= 1;
|
|
}
|
|
r |= a & 1;
|
|
return r;
|
|
}
|
|
|
|
void gf128_set_zero(gf128_t r)
|
|
{
|
|
r[0] = 0;
|
|
r[1] = 0;
|
|
}
|
|
|
|
void gf128_set_one(gf128_t r)
|
|
{
|
|
r[0] = 1;
|
|
r[1] = 0;
|
|
}
|
|
|
|
/*
|
|
void gf128_print_bits(gf128_t a)
|
|
{
|
|
int i;
|
|
|
|
a.hi = reverse_bits(a.hi);
|
|
a.lo = reverse_bits(a.lo);
|
|
|
|
for (i = 0; i < 64; i++) {
|
|
printf("%d", (int)(a.hi % 2));
|
|
a.hi >>= 1;
|
|
}
|
|
for (i = 0; i < 64; i++) {
|
|
printf("%d", (int)(a.lo % 2));
|
|
a.lo >>= 1;
|
|
}
|
|
printf("\n");
|
|
}
|
|
*/
|
|
|
|
int gf128_print(FILE *fp, int fmt, int ind, const char *label, const gf128_t a)
|
|
{
|
|
uint8_t be[16];
|
|
int i;
|
|
|
|
printf("%s: ", label);
|
|
gf128_to_bytes(a, be);
|
|
for (i = 0; i < 16; i++) {
|
|
printf("%02x", be[i]);
|
|
}
|
|
printf("\n");
|
|
return 1;
|
|
}
|
|
|
|
void gf128_from_bytes(gf128_t r, const uint8_t p[16])
|
|
{
|
|
r[0] = reverse_bits(GETU64(p));
|
|
r[1] = reverse_bits(GETU64(p + 8));
|
|
}
|
|
|
|
void gf128_to_bytes(const gf128_t a, uint8_t p[16])
|
|
{
|
|
PUTU64(p, reverse_bits(a[0]));
|
|
PUTU64(p + 8, reverse_bits(a[1]));
|
|
}
|
|
|
|
void gf128_add(gf128_t r, const gf128_t a, const gf128_t b)
|
|
{
|
|
r[0] = a[0] ^ b[0];
|
|
r[1] = a[1] ^ b[1];
|
|
}
|
|
|
|
#ifndef ENABLE_GMUL_ARM64
|
|
void gf128_mul(gf128_t r, const gf128_t a, const gf128_t b)
|
|
{
|
|
const uint64_t mask = (uint64_t)1 << 63;
|
|
uint64_t b0 = b[0];
|
|
uint64_t b1 = b[1];
|
|
uint64_t r0 = 0; // incase r is a or b
|
|
uint64_t r1 = 0;
|
|
int i;
|
|
|
|
for (i = 0; i < 64; i++) {
|
|
if (r1 & mask) {
|
|
r1 = r1 << 1 | r0 >> 63;
|
|
r0 = r0 << 1;
|
|
r0 ^= 0x87;
|
|
} else {
|
|
r1 = r1 << 1 | r0 >> 63;
|
|
r0 = r0 << 1;
|
|
}
|
|
|
|
if (b1 & mask) {
|
|
r1 ^= a[1];
|
|
r0 ^= a[0];
|
|
}
|
|
|
|
b1 <<= 1;
|
|
}
|
|
for (i = 0; i < 64; i++) {
|
|
if (r1 & mask) {
|
|
r1 = r1 << 1 | r0 >> 63;
|
|
r0 = r0 << 1;
|
|
r0 ^= 0x87;
|
|
} else {
|
|
r1 = r1 << 1 | r0 >> 63;
|
|
r0 = r0 << 1;
|
|
}
|
|
|
|
if (b0 & mask) {
|
|
r1 ^= a[1];
|
|
r0 ^= a[0];
|
|
}
|
|
|
|
b0 <<= 1;
|
|
}
|
|
|
|
r[0] = r0;
|
|
r[1] = r1;
|
|
}
|
|
#endif
|
|
|
|
void gf128_mul_by_2(gf128_t r, const gf128_t a)
|
|
{
|
|
const uint64_t mask = (uint64_t)1 << 63;
|
|
|
|
if (a[1] & mask) {
|
|
r[1] = a[1] << 1 | a[0] >> 63;
|
|
r[0] = a[0] << 1;
|
|
r[0] ^= 0x87;
|
|
} else {
|
|
r[1] = a[1] << 1 | a[0] >> 63;
|
|
r[0] = a[0] << 1;
|
|
}
|
|
}
|
|
|
|
int gf128_from_hex(gf128_t r, const char *s)
|
|
{
|
|
uint8_t bytes[16];
|
|
size_t len;
|
|
|
|
if (strlen(s) != sizeof(bytes) * 2) {
|
|
error_print();
|
|
return -1;
|
|
}
|
|
if (hex_to_bytes(s, strlen(s), bytes, &len) != 1) {
|
|
error_print();
|
|
return -1;
|
|
}
|
|
gf128_from_bytes(r, bytes);
|
|
return 1;
|
|
}
|
|
|
|
int gf128_equ_hex(const gf128_t a, const char *s)
|
|
{
|
|
gf128_t b;
|
|
|
|
if (gf128_from_hex(b, s) != 1) {
|
|
error_print();
|
|
return -1;
|
|
}
|
|
if (a[0] != b[0] || a[1] != b[1]) {
|
|
return 0;
|
|
}
|
|
return 1;
|
|
}
|
|
|