forked from dolphin-emu/dolphin
b9dd94b9b2
The loops relied on unsigned integer overflow, which is not immediately obvious. Replace them with less clever variants that are clearer. Also implement bn_compare using std::memcmp.
99 lines
1.8 KiB
C++
99 lines
1.8 KiB
C++
// Copyright 2007,2008 Segher Boessenkool <segher@kernel.crashing.org>
|
|
// Licensed under the terms of the GNU GPL, version 2
|
|
// http://www.gnu.org/licenses/old-licenses/gpl-2.0.txt
|
|
|
|
#include <cstdio>
|
|
#include <cstring>
|
|
|
|
#include "Common/CommonTypes.h"
|
|
#include "Common/Crypto/bn.h"
|
|
|
|
static void bn_zero(u8* d, int n)
|
|
{
|
|
std::memset(d, 0, n);
|
|
}
|
|
|
|
static void bn_copy(u8* d, const u8* a, int n)
|
|
{
|
|
std::memcpy(d, a, n);
|
|
}
|
|
|
|
int bn_compare(const u8* a, const u8* b, int n)
|
|
{
|
|
return std::memcmp(a, b, n);
|
|
}
|
|
|
|
void bn_sub_modulus(u8* a, const u8* N, int n)
|
|
{
|
|
u8 c = 0;
|
|
for (int i = n - 1; i >= 0; --i)
|
|
{
|
|
u32 dig = N[i] + c;
|
|
c = (a[i] < dig);
|
|
a[i] -= dig;
|
|
}
|
|
}
|
|
|
|
void bn_add(u8* d, const u8* a, const u8* b, const u8* N, int n)
|
|
{
|
|
u8 c = 0;
|
|
for (int i = n - 1; i >= 0; --i)
|
|
{
|
|
u32 dig = a[i] + b[i] + c;
|
|
c = (dig >= 0x100);
|
|
d[i] = dig;
|
|
}
|
|
|
|
if (c)
|
|
bn_sub_modulus(d, N, n);
|
|
|
|
if (bn_compare(d, N, n) >= 0)
|
|
bn_sub_modulus(d, N, n);
|
|
}
|
|
|
|
void bn_mul(u8* d, const u8* a, const u8* b, const u8* N, int n)
|
|
{
|
|
bn_zero(d, n);
|
|
|
|
for (int i = 0; i < n; i++)
|
|
{
|
|
for (u8 mask = 0x80; mask != 0; mask >>= 1)
|
|
{
|
|
bn_add(d, d, d, N, n);
|
|
if ((a[i] & mask) != 0)
|
|
bn_add(d, d, b, N, n);
|
|
}
|
|
}
|
|
}
|
|
|
|
void bn_exp(u8* d, const u8* a, const u8* N, int n, const u8* e, int en)
|
|
{
|
|
u8 t[512];
|
|
|
|
bn_zero(d, n);
|
|
d[n - 1] = 1;
|
|
for (int i = 0; i < en; i++)
|
|
{
|
|
for (u8 mask = 0x80; mask != 0; mask >>= 1)
|
|
{
|
|
bn_mul(t, d, d, N, n);
|
|
if ((e[i] & mask) != 0)
|
|
bn_mul(d, t, a, N, n);
|
|
else
|
|
bn_copy(d, t, n);
|
|
}
|
|
}
|
|
}
|
|
|
|
// only for prime N -- stupid but lazy, see if I care
|
|
void bn_inv(u8* d, const u8* a, const u8* N, int n)
|
|
{
|
|
u8 t[512], s[512];
|
|
|
|
bn_copy(t, N, n);
|
|
bn_zero(s, n);
|
|
s[n - 1] = 2;
|
|
bn_sub_modulus(t, s, n);
|
|
bn_exp(d, a, N, n, t, n);
|
|
}
|