ECDSA verification: Refactor a*g + b*p multiplication #1757
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.
Only the nistz256 implementation should be doing this multiplication in the naïve way. Even then, we should be using the optimized variable-time implementation from BoringSSL, so bring it in and use it.
After this PR, we can more easily replace
twin_mul_inefficient
with a proper twin multiplication implementation that works for any curve.See the individual commit messages to see the changes made to the imported BoringSSL code; the second commit imports it unmodified, and the third commit makes the needed changes.