Closed adr1anh closed 3 years ago
This implements #41 by adding the arith.Modulus type. When the factorization of N is known, this can yield a 2x speedup for modular exponentiation. In general, the protocols may run up to 33% faster
arith.Modulus
This implements #41 by adding the
arith.Modulus
type. When the factorization of N is known, this can yield a 2x speedup for modular exponentiation. In general, the protocols may run up to 33% faster