-
Notifications
You must be signed in to change notification settings - Fork 187
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Generalizing MulByGenerator for other points #939
Comments
Better precomputation support, including precomputing tables for arbitrary points, and especially via a trait-based API that could be used across curves, would definitely be something nice to have |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
MulByGenerator exposes a faster multiplication using a precomputed table. Is there any interest in extending this support for handling other (application supplied) points, where the cost of precomputation can similarly be amortized over many multiplications?
For context DFINITY's threshold ECDSA implementation uses
k256
andp256
and there we have two generators, namely the typical one used in the group plus a second (derived using hash to curve) so we can do Pedersen commitments.The text was updated successfully, but these errors were encountered: