AdamWhiteHat

tuxxy

#!/usr/bin/env python3
from Cryptodome.PublicKey import RSA


# A proof of concept demo showing the multiplicative limited
# homomorphic qualities of unpadded RSA
# (Unpadded RSA is not secure by modern standards)

def gen_key(size):
    key = RSA.generate(size)

AdamWhiteHat

public static class HashCodeHelper
{
    public static int Combine(int h1, int h2)
    {
        uint num = (uint)((h1 << 5) | (int)((uint)h1 >> 27));
        return ((int)num + h1) ^ h2;
    }
}

AdamWhiteHat

public static class BigIntegerExtensionMethods
{
    public static BigInteger Sum(this IEnumerable<BigInteger> source)
    {
        return source.Aggregate((accumulator, current) => accumulator + current);
    }
    
    public static BigInteger Product(this IEnumerable<BigInteger> source)
    {
        return source.Aggregate((accumulator, current) => accumulator * current);

AdamWhiteHat

public static class Eratosthenes
{
    public static IEnumerable<BigInteger> Sieve(Int64 maxValue)
    {
        if (maxValue < 10)
        {
            if (maxValue == 9 || maxValue == 8 || maxValue == 7)
            {
                return new List<BigInteger>() { 2, 3, 5, 7 };
            }

AdamWhiteHat

public static class PrimeFactory
{
    private static BigInteger _cacheLargestPrimeCurrently;
    private static BigInteger _cacheCeiling;
    internal static BigInteger[] _primeCache;

    static PrimeFactory()
    {
        _cacheCeiling = BigInteger.Pow(11, 7);
        _primeCache = new BigInteger[] { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47 };

AdamWhiteHat

using System.Numerics;

public static class Factorization
{
    private static BigInteger _cacheCeiling;
    private static List<BigInteger> _primeCache;
    private static BigInteger _cacheLargestPrimeCurrently;
    private static BigInteger[] _probablePrimeCheckBases;

    static Factorization()

AdamWhiteHat

public class ANS1PrivateKey : IDisposable
{
	public BigInteger Modulus = BigInteger.MinusOne;
	public BigInteger Exponent = BigInteger.MinusOne;
	public BigInteger P = BigInteger.MinusOne;
	public BigInteger Q = BigInteger.MinusOne;
	public BigInteger D = BigInteger.MinusOne;
	public BigInteger DP = BigInteger.MinusOne;
	public BigInteger DQ = BigInteger.MinusOne;
	public BigInteger InverseQ = BigInteger.MinusOne;

AdamWhiteHat

/// <summary>
/// Cryptographically secure random number generator. Features a safe, secure, and correct implementation.
/// Numbers are evenly distributed across the whole range; avoids modulo bias.
/// Internal buffers always cleared after every value returned--leaves nothing in memory.
/// Singleton intended to be instantiated only once for the lifetime of the application.
/// Remember to call Dispose when no longer needed.
/// </summary>
public static class CryptoRandomSingleton
{

AdamWhiteHat

using System;
using System.Linq;
using System.Numerics;
using System.Collections.Generic;

public static class Maths
{
	/// <summary>
	/// Legendre Symbol returns 1 for a (nonzero) quadratic residue mod p, -1 for a non-quadratic residue (non-residue), or 0 on zero.
	/// </summary>