v0.7.1

• Fixes bug in docs of scicrypt-bigint that caused it to crash on docs.rs
• Equality checking is now done in constant-time and is correct regardless if the number of limbs differs between the operands
• Comparisons are now correct but run in variable-time. A convenient way of comparing a and b is a.leak() < b.leak(). In other words, leaky overloaded operators are supported after calling leak() on an UnsignedInteger. Otherwise, all overloaded operators run in constant-time.
• Implemented Hash for UnsignedIntegers
• Implemented div_rem (constant-time) for UnsignedIntegers. The div operation simply calls this function and 'forgets' the remainder.
• Implemented reduce_leaky, which cuts away all leading zero-limbs from an UnsignedInteger. This fixes a bug when exporting to rug's integers.
• Implemented Send for UnsignedInteger

v0.7.0

• New crate: scicrypt-bigint. These BigIntegers internally use GMP's constant-time functions.
• The whole library now uses scicrypt-bigint
• Split encryption into encrypt_without_randomness and randomize

v0.6.1

• Implements Serde for several cryptosystems
• Implements ciphertext subtraction, constant addition and constant subtraction for additively homomorphic cryptosystems
• Implements a decrypt-to-identity operation (which is faster for some cryptosystems than decryption and checking for identity)

v0.6.0

• Overhauled the API (for homomorphic encryption)

v0.5.0

• Order of magnitude faster safe prime generation (comparable to OpenSSL)
• Provisional traits for secret sharing