You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I just stumbled across this project and was interested to test it out and compare performance with GMP. I am writing software to factor Mersenne numbers, and my use case deals mostly with 1 to 2 limb(64bit) values, so mppp being optimized for small values sounded ideal. But I make heavy use of modular exponentiation (mpz_powm), plus a few calls to mpz_invert.
Searching through the documentation I didn't immediately see any reference to either. Are these planned to be added eventually?
The text was updated successfully, but these errors were encountered:
@thehans just a quick update. I haven't had much time to look into this feature in the last couple of months, so I think it is unlikely it will end up in mp++ 0.18 (which I would like to release relatively soon for other reasons).
I did some preliminary work in #205 with the implementation of (modular) squaring but I really need to go and study in some detail what GMP is doing before coming up with a subpar solution. This is an area of multiprecision arithmetics which I hadn't really much looked into before, and I really need to study the topic a bit more.
I just stumbled across this project and was interested to test it out and compare performance with GMP. I am writing software to factor Mersenne numbers, and my use case deals mostly with 1 to 2 limb(64bit) values, so mppp being optimized for small values sounded ideal. But I make heavy use of modular exponentiation (mpz_powm), plus a few calls to
mpz_invert
.Searching through the documentation I didn't immediately see any reference to either. Are these planned to be added eventually?
The text was updated successfully, but these errors were encountered: