-
Notifications
You must be signed in to change notification settings - Fork 37
Open
Description
I'm working on a Rust implementation of Paillier cryptosystem (https://github.com/kunerd/rpaillier). After I started I realised a lag of fundamental big number arithmetic functions like mod_pow
and mod_inverse
. At the moment there is also no way to generate probably primes. So I started to implement them by myself.
Now I want to ask, if there is an interest to add these algorithms to this project?
current state of my implementation:
mod_pow
: Implementation of LR-k-ary algorithm as described in the "Handbook of Applied Cryptography, 14.82".mod_inverse
: Implementation of "Extended Euclidean Algorithm" as described by Knuth
Metadata
Metadata
Assignees
Labels
No labels