Skip to content
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

Impl MulMod for Uint #313

Merged
merged 1 commit into from
Nov 26, 2023
Merged

Impl MulMod for Uint #313

merged 1 commit into from
Nov 26, 2023

Conversation

tarcieri
Copy link
Member

Uses Montgomery multiplication although it may not be the most efficient approach (e.g. a Barrett reduction might be faster).

This also changes the MulMod trait to remove the Montgomery-specific implementation details, allowing a simple mul_mod(self, rhs, p). Optimized Montgomery multiplication is still available via DynResidue.

Closes #70

Uses Montgomery multiplication although it may not be the most efficient
approach (e.g. a Barrett reduction might be faster).

This also changes the `MulMod` trait to remove the Montgomery-specific
implementation details, allowing a simple `mul_mod(self, rhs, p)`.
Optimized Montgomery multiplication is still available via `DynResidue`.

Closes #70
@tarcieri tarcieri merged commit 2fda5f0 into master Nov 26, 2023
15 checks passed
@tarcieri tarcieri deleted the uint/mul-mod branch November 26, 2023 18:06
@tarcieri tarcieri mentioned this pull request Jan 22, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

MulMod not implemented and not properly documented
1 participant