blob: ddce74d31ab003b6007180b3f0f13ab8ec78165c (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
using System;
namespace Org.BouncyCastle.Math.EC.Multiplier
{
public class FixedPointUtilities
{
public static FixedPointPreCompInfo GetFixedPointPreCompInfo(PreCompInfo preCompInfo)
{
if ((preCompInfo != null) && (preCompInfo is FixedPointPreCompInfo))
{
return (FixedPointPreCompInfo)preCompInfo;
}
return new FixedPointPreCompInfo();
}
public static FixedPointPreCompInfo Precompute(ECPoint p, int width)
{
ECCurve c = p.Curve;
int n = 1 << width;
FixedPointPreCompInfo info = GetFixedPointPreCompInfo(c.GetPreCompInfo(p));
ECPoint[] lookupTable = info.PreComp;
if (lookupTable == null || lookupTable.Length != n)
{
BigInteger order = c.Order;
if (order == null)
throw new InvalidOperationException("fixed-point precomputation needs the curve order");
int bits = order.BitLength;
int d = (bits + width - 1) / width;
ECPoint[] pow2Table = new ECPoint[width];
pow2Table[0] = p;
for (int i = 1; i < width; ++i)
{
pow2Table[i] = pow2Table[i - 1].TimesPow2(d);
}
c.NormalizeAll(pow2Table);
lookupTable = new ECPoint[n];
lookupTable[0] = c.Infinity;
for (int bit = width - 1; bit >= 0; --bit)
{
ECPoint pow2 = pow2Table[bit];
int step = 1 << bit;
for (int i = step; i < n; i += (step << 1))
{
lookupTable[i] = lookupTable[i - step].Add(pow2);
}
}
c.NormalizeAll(lookupTable);
info.PreComp = lookupTable;
c.SetPreCompInfo(p, info);
}
return info;
}
}
}
|