module crypto.bigint;

import std.bigint;
import std.algorithm.mutation : reverse, swap;
import std.algorithm.searching : find, all;
import std.conv : to, text;
import std.exception : enforce;
import std.range : repeat, array;
import std.math : abs;

import crypto.random;

struct BigIntHelper
{
    /// Random generate a BigInt by bitLength.
    static BigInt randomGenerate(uint bitLength, int highBit = -1, int lowBit = -1)
    {
        enforce((bitLength > 0) && (bitLength % 8 == 0));

        ubyte[] buffer = new ubyte[bitLength / 8];

        uint pos = 0;
        uint current = 0;
        foreach (ref a; buffer)
        {
            if (pos == 0)
            {
                current = rnd.next;
            }

            a = cast(ubyte)(current >> 8 * pos);
            pos = (pos + 1) % uint.sizeof;
        }

        if (highBit == 0)
        {
            buffer[0] &= (0xFF >> 1);
        }
        else if (highBit == 1)
        {
            buffer[0] |= (0x01 << 7);
        }

        if (lowBit == 0)
        {
            buffer[$ - 1] &= (0xFF << 1);
        }
        else if (lowBit == 1)
        {
            buffer[$ - 1] |= 0x01;
        }

        return BigIntHelper.fromBytes(buffer);
    }

    /// Random generate a BigInt between min and max.
    static BigInt randomGenerate(const BigInt min, const BigInt max)
    {
        enforce(max >= min, text("BigIntHelper.randomGenerate(): invalid bounding interval ", min, ", ", max));

        BigInt r = randomGenerate(cast(uint)((max.uintLength + 1) * uint.sizeof * 8));
        return r % (max - min + 1) + min;
    }

    ///
    static ubyte[] toUBytes(const BigInt value) pure nothrow
    {
        size_t len = value.uintLength();
        ubyte[] ubytes = new ubyte[len * uint.sizeof];

        for (size_t i = 0; i < len; i++)
        {
            uint digit = value.getDigit!uint(i);
            ubyte* p = cast(ubyte*)&digit;

            for (size_t j = 0; j < uint.sizeof; j++)
            {
                ubytes[(len - i - 1) * uint.sizeof + (uint.sizeof - j - 1)] = *(p + j);
            }
        }

        return ubytes.find!((a, b) => a != b)(0);
    }

    /++
        Create a BigInt from an array representing a magnitude,
        most significant element first.

        !! Prior to Phobos version 2.094 here is a performance bottleneck.
    +/
    static BigInt fromBytes(in ubyte[] buffer) pure nothrow
    {
        static if (__VERSION__ >= 2094)
            return BigInt(false, buffer);
        else
        {
            size_t supplement = (uint.sizeof - buffer.length % uint.sizeof) % uint.sizeof;
            ubyte[] bytes = (supplement > 0) ? (cast(ubyte)0).repeat(supplement).array ~ buffer : cast(ubyte[])buffer;
            BigInt data = 0;

            for (size_t i = 0; i < bytes.length / uint.sizeof; i++)
            {
                uint digit;
                ubyte* p = cast(ubyte*)&digit;

                for (size_t j = 0; j < uint.sizeof; j++)
                {
                    *(p + j) = bytes[i * uint.sizeof + uint.sizeof - j - 1];
                }

                data <<= 32;
                data += digit;
            }

            return data;
        }
    }

    static if (__VERSION__ >= 2087)
        alias powmod = std.bigint.powmod;
    else
    {
        ///
        static BigInt powmod(const BigInt base, const BigInt exponent, const BigInt modulus) pure nothrow
        {
            assert(base >= 1 && exponent >= 0 && modulus >= 1);

            if (exponent == 0)
            {
                return BigInt(1) % modulus;
            }

            if (exponent == 1)
            {
                return base % modulus;
            }

            BigInt temp = powmod(base, exponent / 2, modulus);

            return (exponent & 1) ? mul(mul(temp, temp), base) % modulus : mul(temp, temp) % modulus;
        }
    }

    /**
    Test whether BigInt n is prime.
        Step 1: millerRabinPrimeTest
        Step 2: lucasLehmerTest
    */
    static bool isProbablePrime(const BigInt n, const size_t confidence)
    {
        bool passed = millerRabinPrimeTest(n, confidence);

        /**
        When n < 10_000_000_000_000_000,
        there is no need to lucasLehmerTest, And trust the result of millerRabinPrimeTest.
        */
        if (!passed || (n < 10_000_000_000_000_000))
        {
            return passed;
        }

        return lucasLehmerTest(n);
    }

private:

    /++
    Bug BigInt mul() of phobos will be fixed in version 2.087.0
        Details: https://github.com/dlang/phobos/pull/6972
    +/
    static if (__VERSION__ < 2087)
    {
        static BigInt mul(const BigInt a, const BigInt b) pure nothrow
        {
            uint[] au = toUintArray(a);
            uint[] bu = toUintArray(b);

            uint[] r = new uint[au.length + bu.length];

            for (size_t i = 0; i < bu.length; i++)
            {
                for (size_t j = 0; j < au.length; j++)
                {
                    ulong t = cast(ulong)bu[i] * au[j] + r[i + j];
                    r[i + j] = t & 0xFFFF_FFFF;
                    uint c = t >> 32;
                    size_t h = i + j + 1;

                    while (c != 0)
                    {
                        t = cast(ulong)c + r[h];
                        r[h] = t & 0xFFFF_FFFF;
                        c = t >> 32;
                        h++;
                    }
                }
            }

            return fromUintArray(r);
        }

        static uint[] toUintArray(const BigInt data) pure nothrow
        {
            size_t n = data.uintLength();
            uint[] arr = new uint[n];

            for (size_t i = 0; i < n; i++)
            {
                arr[i] = data.getDigit!uint(i);
            }

            return arr;
        }

        static BigInt fromUintArray(const uint[] arr) pure nothrow
        {
            size_t zeros = 0;
            foreach_reverse (d; arr)
            {
                if (d != 0)
                {
                    break;
                }

                zeros++;
            }

            BigInt data = 0;

            foreach_reverse (d; arr[0..$ - zeros])
            {
                data <<= 32;
                data += d;
            }

            return data;
        }
    }

    ///
    static bool millerRabinPrimeTest(const BigInt n, const size_t confidence)
    {
        enforce(confidence > 0, "confidence must be a positive integer greater than 0.");

        if (n < 2)
        {
            return false;
        }
        if (n == 2)
        {
            return true;
        }

        BigInt[] bases;
        if (n < 1_373_653)
        {
            bases = [BigInt(2), BigInt(3)];
        }
        else if (n <= 9_080_191)
        {
            bases = [BigInt(31), BigInt(73)];
        }
        else if (n <= 4_759_123_141)
        {
            bases = [BigInt(2), BigInt(7), BigInt(61)];
        }
        else if (n <= 2_152_302_898_747)
        {
            bases = [BigInt(2), BigInt(3), BigInt(5), BigInt(7), BigInt(11)];
        }
        else if (n <= 341_550_071_728_320)
        {
            if (n == 46_856_248_255_981)
            {
                return false;
            }

            bases = [BigInt(2), BigInt(3), BigInt(5), BigInt(7), BigInt(11), BigInt(13), BigInt(17)];
        }
        else if (n < 10_000_000_000_000_000)
        {
            bases = [BigInt(2), BigInt(3), BigInt(7), BigInt(61), BigInt(24251)];
        }
        else
        {
            if (!smallPrimesTable.all!((prime) => (powmod(prime, n - 1, n) == 1)))
            {
                return false;
            }

            /**
            Although in theory base should be between 2 and n - 1, because confidence is optimized before call,
            the larger n is, the smaller confidence is, so the requirement for base can not be too small,
            so the minimum value does not use 2, but uses n / 2 instead.
            */
            bases = new BigInt[confidence];
            import std.algorithm.iteration : each;
            bases.each!((ref b) => (b = randomGenerate(n / 2, n - 1)));
            //bases.each!((ref b) => (b = randomGenerate(BigInt(2), n - 1)));
        }

        return (bases.all!((base) => (powmod(base, n - 1, n) == 1)));
    }

    /**
    Returns true if n is a Lucas-Lehmer probable prime.
        The following assumptions are made:
        BigInt n is a positive, odd number. So it can only be call after millerRabinPrimeTest is passed.
    */
    static bool lucasLehmerTest(const BigInt n)
    {
        immutable BigInt nPlusOne = n + 1;

        int d = 5;
        while (jacobiSymbol(d, n) != -1)
        {
            // 5, -7, 9, -11, ...
            d = (d < 0) ? abs(d) + 2 : -(d + 2);
        }

        return lucasLehmerSequence(d, nPlusOne, n) % n == 0;
    }

    static int jacobiSymbol(int p, const BigInt n)
    {
        if (p == 0)
            return 0;

        int j = 1;
        int u = cast(int) (n.getDigit!uint(0));

        // Make p positive
        if (p < 0)
        {
            p = -p;
            immutable n8 = u & 7;
            if ((n8 == 3) || (n8 == 7))
                j = -j; // 3 (011) or 7 (111) mod 8
        }

        // Get rid of factors of 2 in p
        while ((p & 3) == 0)
            p >>= 2;
        if ((p & 1) == 0)
        {
            p >>= 1;
            if (((u ^ (u >> 1)) & 2) != 0)
                j = -j; // 3 (011) or 5 (101) mod 8
        }
        if (p == 1)
            return j;

        // Then, apply quadratic reciprocity
        if ((p & u & 2) != 0)   // p = u = 3 (mod 4)?
            j = -j;
        // And reduce u mod p
        u = n % p;

        // Now compute Jacobi(u,p), u < p
        while (u != 0)
        {
            while ((u & 3) == 0)
                u >>= 2;
            if ((u & 1) == 0)
            {
                u >>= 1;
                if (((p ^ (p >> 1)) & 2) != 0)
                    j = -j;     // 3 (011) or 5 (101) mod 8
            }
            if (u == 1)
                return j;

            // Now both u and p are odd, so use quadratic reciprocity
            assert(u < p);
            swap(u, p);
            if ((u & p & 2) != 0) // u = p = 3 (mod 4)?
                j = -j;

            // Now u >= p, so it can be reduced
            u %= p;
        }

        return 0;
    }

    static BigInt lucasLehmerSequence(const int z, const BigInt k, const BigInt n)
    {
        bool testBit(const BigInt n, const int m)
        {
            int digit = cast(int) (n.getDigit!uint(m >>> 5));
            return (digit & (1 << (m & 31))) != 0;
        }

        BigInt d = z;
        BigInt u = 1, u2;
        BigInt v = 1, v2;

        for (int i = cast(int)(k.uintLength * uint.sizeof * 8 - 2); i >= 0; i--)
        {
            u2 = (u * v) % n;
            v2 = (v * v + d * u * u) % n;
            if (testBit(v2, 0))
                v2 -= n;
            v2 >>= 1;

            u = u2; v = v2;
            if (testBit(k, i))
            {
                u2 = (u + v) % n;
                if (testBit(u2, 0))
                    u2 -= n;

                u2 >>= 1;
                v2 = (v + d * u) % n;
                if (testBit(v2, 0))
                    v2 -= n;
                v2 >>= 1;

                u = u2; v = v2;
            }
        }

        return u;
    }

    immutable static BigInt[] smallPrimesTable = [
        2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61,
        67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137,
        139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211,
        223, 227, 229, 233, 239, 241 ];
}