For educational reasons I am implementing an e-voting platform. The idea is that the voter generates the ballot on client side, the ballot is verified using a zero-knowledge proof protocol. Also, the voter encrypts the the ballot before to send it to the server. The server can sum all the encrypt...

For RSA, we need two primes p and q to define N = pq. We will only look how long it takes to generate a prime for p because the process is similar for q. From my lecture slides, my professor states that the Rabin-Miller prime testing "algorithm can be made deterministic assuming the GRH (!), by r...