diff options
| author | Peter Dettman <peter.dettman@bouncycastle.org> | 2023-03-01 15:36:59 +0700 |
|---|---|---|
| committer | Peter Dettman <peter.dettman@bouncycastle.org> | 2023-03-01 15:36:59 +0700 |
| commit | 9e5fbf512406bae2717166efc2d49920f4414328 (patch) | |
| tree | ac1b0f742493d28d183ebc895287169ec1fdcd2d | |
| parent | Refactoring around ASN.1 DL encodings (diff) | |
| download | BouncyCastle.NET-ed25519-9e5fbf512406bae2717166efc2d49920f4414328.tar.xz | |
BIKE init perf. opts.
| -rw-r--r-- | crypto/src/pqc/crypto/bike/BikeRing.cs | 37 |
1 files changed, 22 insertions, 15 deletions
diff --git a/crypto/src/pqc/crypto/bike/BikeRing.cs b/crypto/src/pqc/crypto/bike/BikeRing.cs index b946b3f64..ea023e004 100644 --- a/crypto/src/pqc/crypto/bike/BikeRing.cs +++ b/crypto/src/pqc/crypto/bike/BikeRing.cs @@ -34,11 +34,12 @@ namespace Org.BouncyCastle.Pqc.Crypto.Bike m_size = (r + 63) >> 6; m_sizeExt = m_size * 2; + uint r32 = Mod.Inverse32((uint)-r); foreach (int n in EnumerateSquarePowersInv(r)) { if (n >= PermutationCutoff && !m_halfPowers.ContainsKey(n)) { - m_halfPowers[n] = GenerateHalfPower(r, n); + m_halfPowers[n] = GenerateHalfPower((uint)r, r32, n); } } } @@ -195,15 +196,6 @@ namespace Org.BouncyCastle.Pqc.Crypto.Bike return t + ((t >> 31) & m); } -#if NETSTANDARD1_0_OR_GREATER || NETCOREAPP1_0_OR_GREATER - [MethodImpl(MethodImplOptions.AggressiveInlining)] -#endif - private static int ImplModHalf(int m, int x) - { - int t = -(x & 1); - return (x + (m & t)) >> 1; - } - private void ImplMultiplyAcc(ulong[] x, ulong[] y, ulong[] zz) { #if NETCOREAPP3_0_OR_GREATER @@ -377,14 +369,29 @@ namespace Org.BouncyCastle.Pqc.Crypto.Bike } } - private static int GenerateHalfPower(int r, int n) + private static int GenerateHalfPower(uint r, uint r32, int n) { - int p = 1; - for (int k = 0; k < n; ++k) + uint p = 1; + int k = n; + while (k >= 32) + { + uint y = r32 * p; + ulong t = (ulong)y * r; + ulong u = t + p; + Debug.Assert((uint)u == 0U); + p = (uint)(u >> 32); + k -= 32; + } + if (k > 0) { - p = ImplModHalf(r, p); + uint mk = uint.MaxValue >> -k; + uint y = (r32 * p) & mk; + ulong t = (ulong)y * r; + ulong u = t + p; + Debug.Assert(((uint)u & mk) == 0U); + p = (uint)(u >> k); } - return p; + return (int)p; } private static void ImplMulwAcc(ulong[] u, ulong x, ulong y, ulong[] z, int zOff) |