You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
217 lines
6.0 KiB
217 lines
6.0 KiB
using System;
|
|
using System.Diagnostics;
|
|
|
|
using Org.BouncyCastle.Crypto.Utilities;
|
|
using Org.BouncyCastle.Math.Raw;
|
|
using Org.BouncyCastle.Security;
|
|
|
|
namespace Org.BouncyCastle.Math.EC.Custom.Sec
|
|
{
|
|
internal class SecP192K1Field
|
|
{
|
|
// 2^192 - 2^32 - 2^12 - 2^8 - 2^7 - 2^6 - 2^3 - 1
|
|
internal static readonly uint[] P = new uint[]{ 0xFFFFEE37, 0xFFFFFFFE, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF,
|
|
0xFFFFFFFF };
|
|
private static readonly uint[] PExt = new uint[]{ 0x013C4FD1, 0x00002392, 0x00000001, 0x00000000, 0x00000000,
|
|
0x00000000, 0xFFFFDC6E, 0xFFFFFFFD, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF };
|
|
private static readonly uint[] PExtInv = new uint[]{ 0xFEC3B02F, 0xFFFFDC6D, 0xFFFFFFFE, 0xFFFFFFFF,
|
|
0xFFFFFFFF, 0xFFFFFFFF, 0x00002391, 0x00000002 };
|
|
private const uint P5 = 0xFFFFFFFF;
|
|
private const uint PExt11 = 0xFFFFFFFF;
|
|
private const uint PInv33 = 0x11C9;
|
|
|
|
public static void Add(uint[] x, uint[] y, uint[] z)
|
|
{
|
|
uint c = Nat192.Add(x, y, z);
|
|
if (c != 0 || (z[5] == P5 && Nat192.Gte(z, P)))
|
|
{
|
|
Nat.Add33To(6, PInv33, z);
|
|
}
|
|
}
|
|
|
|
public static void AddExt(uint[] xx, uint[] yy, uint[] zz)
|
|
{
|
|
uint c = Nat.Add(12, xx, yy, zz);
|
|
if (c != 0 || (zz[11] == PExt11 && Nat.Gte(12, zz, PExt)))
|
|
{
|
|
if (Nat.AddTo(PExtInv.Length, PExtInv, zz) != 0)
|
|
{
|
|
Nat.IncAt(12, zz, PExtInv.Length);
|
|
}
|
|
}
|
|
}
|
|
|
|
public static void AddOne(uint[] x, uint[] z)
|
|
{
|
|
uint c = Nat.Inc(6, x, z);
|
|
if (c != 0 || (z[5] == P5 && Nat192.Gte(z, P)))
|
|
{
|
|
Nat.Add33To(6, PInv33, z);
|
|
}
|
|
}
|
|
|
|
public static uint[] FromBigInteger(BigInteger x)
|
|
{
|
|
uint[] z = Nat.FromBigInteger(192, x);
|
|
if (z[5] == P5 && Nat192.Gte(z, P))
|
|
{
|
|
Nat192.SubFrom(P, z);
|
|
}
|
|
return z;
|
|
}
|
|
|
|
public static void Half(uint[] x, uint[] z)
|
|
{
|
|
if ((x[0] & 1) == 0)
|
|
{
|
|
Nat.ShiftDownBit(6, x, 0, z);
|
|
}
|
|
else
|
|
{
|
|
uint c = Nat192.Add(x, P, z);
|
|
Nat.ShiftDownBit(6, z, c);
|
|
}
|
|
}
|
|
|
|
public static void Inv(uint[] x, uint[] z)
|
|
{
|
|
Mod.CheckedModOddInverse(P, x, z);
|
|
}
|
|
|
|
public static int IsZero(uint[] x)
|
|
{
|
|
uint d = 0;
|
|
for (int i = 0; i < 6; ++i)
|
|
{
|
|
d |= x[i];
|
|
}
|
|
d = (d >> 1) | (d & 1);
|
|
return ((int)d - 1) >> 31;
|
|
}
|
|
|
|
public static void Multiply(uint[] x, uint[] y, uint[] z)
|
|
{
|
|
uint[] tt = Nat192.CreateExt();
|
|
Nat192.Mul(x, y, tt);
|
|
Reduce(tt, z);
|
|
}
|
|
|
|
public static void MultiplyAddToExt(uint[] x, uint[] y, uint[] zz)
|
|
{
|
|
uint c = Nat192.MulAddTo(x, y, zz);
|
|
if (c != 0 || (zz[11] == PExt11 && Nat.Gte(12, zz, PExt)))
|
|
{
|
|
if (Nat.AddTo(PExtInv.Length, PExtInv, zz) != 0)
|
|
{
|
|
Nat.IncAt(12, zz, PExtInv.Length);
|
|
}
|
|
}
|
|
}
|
|
|
|
public static void Negate(uint[] x, uint[] z)
|
|
{
|
|
if (0 != IsZero(x))
|
|
{
|
|
Nat192.Sub(P, P, z);
|
|
}
|
|
else
|
|
{
|
|
Nat192.Sub(P, x, z);
|
|
}
|
|
}
|
|
|
|
public static void Random(SecureRandom r, uint[] z)
|
|
{
|
|
byte[] bb = new byte[6 * 4];
|
|
do
|
|
{
|
|
r.NextBytes(bb);
|
|
Pack.LE_To_UInt32(bb, 0, z, 0, 6);
|
|
}
|
|
while (0 == Nat.LessThan(6, z, P));
|
|
}
|
|
|
|
public static void RandomMult(SecureRandom r, uint[] z)
|
|
{
|
|
do
|
|
{
|
|
Random(r, z);
|
|
}
|
|
while (0 != IsZero(z));
|
|
}
|
|
|
|
public static void Reduce(uint[] xx, uint[] z)
|
|
{
|
|
ulong cc = Nat192.Mul33Add(PInv33, xx, 6, xx, 0, z, 0);
|
|
uint c = Nat192.Mul33DWordAdd(PInv33, cc, z, 0);
|
|
|
|
Debug.Assert(c == 0 || c == 1);
|
|
|
|
if (c != 0 || (z[5] == P5 && Nat192.Gte(z, P)))
|
|
{
|
|
Nat.Add33To(6, PInv33, z);
|
|
}
|
|
}
|
|
|
|
public static void Reduce32(uint x, uint[] z)
|
|
{
|
|
if ((x != 0 && Nat192.Mul33WordAdd(PInv33, x, z, 0) != 0)
|
|
|| (z[5] == P5 && Nat192.Gte(z, P)))
|
|
{
|
|
Nat.Add33To(6, PInv33, z);
|
|
}
|
|
}
|
|
|
|
public static void Square(uint[] x, uint[] z)
|
|
{
|
|
uint[] tt = Nat192.CreateExt();
|
|
Nat192.Square(x, tt);
|
|
Reduce(tt, z);
|
|
}
|
|
|
|
public static void SquareN(uint[] x, int n, uint[] z)
|
|
{
|
|
Debug.Assert(n > 0);
|
|
|
|
uint[] tt = Nat192.CreateExt();
|
|
Nat192.Square(x, tt);
|
|
Reduce(tt, z);
|
|
|
|
while (--n > 0)
|
|
{
|
|
Nat192.Square(z, tt);
|
|
Reduce(tt, z);
|
|
}
|
|
}
|
|
|
|
public static void Subtract(uint[] x, uint[] y, uint[] z)
|
|
{
|
|
int c = Nat192.Sub(x, y, z);
|
|
if (c != 0)
|
|
{
|
|
Nat.Sub33From(6, PInv33, z);
|
|
}
|
|
}
|
|
|
|
public static void SubtractExt(uint[] xx, uint[] yy, uint[] zz)
|
|
{
|
|
int c = Nat.Sub(12, xx, yy, zz);
|
|
if (c != 0)
|
|
{
|
|
if (Nat.SubFrom(PExtInv.Length, PExtInv, zz) != 0)
|
|
{
|
|
Nat.DecAt(12, zz, PExtInv.Length);
|
|
}
|
|
}
|
|
}
|
|
|
|
public static void Twice(uint[] x, uint[] z)
|
|
{
|
|
uint c = Nat.ShiftUpBit(6, x, 0, z);
|
|
if (c != 0 || (z[5] == P5 && Nat192.Gte(z, P)))
|
|
{
|
|
Nat.Add33To(6, PInv33, z);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|