Piotr Dyraga
f5a107a36f
I've adapted a Go code for generating random numbers by inserting some optimisations that will allow us to generate safe primes faster than with the previous, naive approach. First of all, having q which can be prime, we first check whether q%3=1. If that's true, there is no chance p=2q+1 is prime. It lets us to reject candidate numbers quicker without running an expensive primality tests. Also, before we run a primality test for q, we may check p=2q+1 against the primes between 3-53 (We are limited by Go's uint64 range). If all those conditions are met and we know p is prime, it's enough to check Pocklington criterion for q instead of running an expensive primality test for it.
paillier
Go implementation of the paillier cryptosystem and threshold paillier crytposystem.
introduction
Implementation of the paillier cryptosystem. See http://en.wikipedia.org/wiki/Paillier_cryptosystem for an introduction.
The threshold paillier cryptosystem is a translation of the java version that can be found at http://cs.utdallas.edu/dspl/cgi-bin/pailliertoolbox/ that is an implementation of the algorithm defined in Damgård's paper "A Generalization of Paillier's Public-Key System with Applications to Electronic Voting".
Another important feature of the library is the ease of serilisation of all the structs in JSON and BSON.
Implements the paillier cryptosystem and threshold paillier crytposystem.
caveat
As any cryptographic library, if you use it, you need to trust it. Unfortunatly, this library as not been verified by a third party. There might be some bugs and vulnerabilities. If you find one, please fill a bug.
If you need to encrypt something serious, use the library provided by Go. If you want to have fun, use Paillier!