big number modular arithmetics about num HOT 5 CLOSED

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

https://github.com/kunerd/rpaillier

from num.

+1 for mod_pow

from num.

@kunerd , if you propose a PR, it will get more chance to get accepted, especially if you've already implemented it

from num.

My current solution adds a 'trait' for each of the two functions, but I don't know, if this is a good practice. It will be my first PR and I think I need some help.

from num.

acrichton and I decided to create separate crates for the functionalities described above. (see here: #104)
My newly created repository for mod_pow can be found here:
https://github.com/kunerd/mod_pow

from num.