Adam White AdamWhiteHat

## HashCodeHelper.cs
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;
    }
}

## Eratosthenes.cs
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 };
            }

## prime-sieve.svg

      
              1 file
            
          
              0 forks
            
          
              1 comment
            
          
              1 star
            
          
                AdamWhiteHat
                / prime-sieve.svg
            
            
              Created
              December 22, 2016 21:21
            
              
                Javascript in SVG example (prime circles)
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## homomorphic_rsa_demo.py
#!/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)
	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;
	}
	}
	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 };
	}
	#!/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)