WARNING: WHILE THIS LIBRARY MAKES SOME EFFORT FOR SECURE IMPLEMENTATIONS, IT SHOULD NOT BE USED FOR ANY PRACTICAL APPLICATIONS. THE CODE IS NOT AUDITED. WE MAKE NO GUARANTEES ABOUT THE CODE'S CORRECTNESS NOR SECURITY.
Lightweight cryptographic building blocks for proof of concept implementations in applied cryptography.
While many libraries implementing cryptographic building blocks exist, many fall in one of two categories:
- Fast but rigid, like many written in C++
- Slow but flexible, like many written in python
This library attempts to find a balance between speed and flexibility, to ease the process of implementing proof of concepts of cryptographic protocols, such as those in the field of multi- party computation (MPC).
Currently, the library implements the following homomorphic cryptosystems and the associated homomorphic operations:
- ElGamal over Curve25519 (Ristretto-encoded) and two threshold versions
- ElGamal over safe prime groups and two threshold versions
- Paillier and threshold Paillier
In addition, the library implements safe prime generation, which is faster than the same functionality implemented in other crates. The code is benchmarked between every version to ensure we do not increase run time and to compare against other implementations.
Check the table below for an average run time comparison (in milliseconds) for safe prime generation:
Updated: 31 Mar 2022 from GitHub Actions
You can run this benchmark yourself by executing
cargo bench --bench prime_gen. By default, this benchmark is turned off because it can take up to 15 minutes to run. In other words, it will not run when you simply run
cargo bench. Note that on my personal laptop, OpenSSL slightly outperforms scicrypt on average, so results can differ based on hardware.
These are the upcoming minor versions and the functionality they will add.