We’ve noticed during our evaluation that Mocana’s ephemeral key generation is multiple times faster than our key generator. How is this possible? Are the primes weaker with your algorithm?
No, our primes are exactly the same primes -- we just find them faster. We’re using a trick called a prime sieve to find primes faster. The prime sieve allows us to immediately rule out bad prime candidates; multiples of 2, 3, 5, 7, 11, 13, etc. Prime sieves generally take a lot of memory, but we have a clever approach, which requires 0.5% of memory than a normal prime sieve. We employ some other tricks to speed up the process, please see sieve.c and prime.c for more details.Read More