Add Booth encoding based variable point multiplication #4627
Conversation
This file contains 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
|
This algorithm is based on OpenSSL's nistz_p256, which is at this point (afaict) the last remaining faster EC library. I had expected better speedups, considering, but it seems like the field arithmetic is really the critical thing here. Improving that is left for future work. The comment here will likely be helpful wrt review. |
Improves variable point mul (and ECDH) by around 4-5%
a5c9dcd to
51bcf2a
Compare
37 tasks
|
in theory https://eprint.iacr.org/2013/816.pdf describes the algorithm but it doesn't do a great job of it |
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.
Improves variable point mul (and ECDH) by around 4-5%