Crate libpaillier

Paillier-rs contains Paillier’s cryptosystem (1999) Public-Key Cryptosystems based on composite degree residuosity class. See http://citeseerx.ist.psu.edu/download?doi=10.1.1.4035&rep=rep1&type=pdf

Re-exports

• pub use unknown_order;

Structs

• DecryptionKey
  A Paillier decryption key
• EncryptionKey
  A Paillier encryption key
• ProofSquareFree
  Proof that a Paillier modulus is square free. The proof checks that there are “small” factors, that can be inverted in with a Paillier modulus and the number of parallel instances needed for soundness relates to how high to check. For a security parameter k, where we check for prime factors up to t, need l parallel instances where l is the smallest integer such that t^l > 2^k. For 128-bit security, t = 1000 and l = 13, and Paillier modulus is ≥ 2048 bits.

Type Aliases

• Ciphertext
  A Paillier Ciphertext
• Nonce
  A Paillier nonce used during encryption