Structs§

  • Represents the private key for the Paillier cryptosystem.
  • Represents the public key for the Paillier cryptosystem.

Functions§

  • Calculates the Carmichael function for two prime numbers.
  • Chooses a non-zero BigUint in the range 1 to n^2.
  • When we choose p & q of same length we can simply take g=n+1 this will do the job.
  • Generates a pair of prime numbers each of a specified bit size for use in the Paillier cryptosystem.
  • Generates a public and private key pair for the Paillier cryptosystem.
  • Calculates the modular multiplicative inverse of phi (φ(n)) modulo n^2.