Skip to content

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
@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

2 participants