Using gmpy2's mulmod to accelerate the mulmod operation #99
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
According to data61#98, the mulmod operation(mulmod(a, b, c) = a * b % c) could be accelerated by using gmpy2.mpz when a, b, and c are very large numbers. The main changes are: * add a mulmod funciton in util.py * use util.mulmod function to wrap the mulmod operation in paillier.py
hardbyte
approved these changes
Apr 18, 2022
| if self.n - self.max_int <= plaintext < self.n: | ||
| # Very large plaintext, take a sneaky shortcut using inverses | ||
| neg_plaintext = self.n - plaintext # = abs(plaintext - nsquare) | ||
| # avoid using gmpy2's mulmod when a * b < c |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
According to #98, the mulmod operation(mulmod(a, b, c) = a * b % c)
could be accelerated by using gmpy2.mpz when a, b, and c
are very large numbers.
The main changes are: