RustCrypto / RustCrypto/elliptic-curves
Generalizing MulByGenerator for other points
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 874
- Forks
- 299
- Avg merge
- 1d 4h
- Merged PRs (30d)
- 12
Description
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 and p256 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.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reading the MulByGenerator entry point and how it is used for k256 and p256. Investigate the precomputed-table assumptions and the threshold ECDSA use case with a second hash-to-curve point. Done would require an agreed design for application-supplied points and evidence that repeated multiplications benefit from amortized precomputation.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- cryptography
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100