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.

Sign up for GitHub

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

Jump to bottom

Investigate specialised mulmod for base*cuml in modexp #62

Open
unzvfu opened this issue Sep 24, 2018 · 1 comment
Open

Investigate specialised mulmod for base*cuml in modexp #62

unzvfu opened this issue Sep 24, 2018 · 1 comment

Comments

@unzvfu
Copy link
Collaborator

unzvfu commented Sep 24, 2018 •
edited
Loading

In the modular exponentiation algorithms, there are repeated mulmods of the form A <- A.g where g is the base and A is the intermediate value of the modexp. Since g is fixed for over all such mulmods, it might be possible to find a better representation of g and an associated specialised mulmod algorithm to speed up those mulmods.
@unzvfu unzvfu self-assigned this Sep 24, 2018
@unzvfu unzvfu mentioned this issue Mar 21, 2020
Open
@unzvfu
Copy link
Collaborator Author

unzvfu commented Mar 21, 2020

Follow up at unzvfu#35.

@unzvfu unzvfu removed their assignment Mar 21, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@unzvfu