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 #35

Open
unzvfu opened this issue Mar 21, 2020 · 0 comments
Open

Investigate specialised mulmod for base*cuml in modexp #35

unzvfu opened this issue Mar 21, 2020 · 0 comments
Assignees
@unzvfu

Comments

@unzvfu
Copy link
Owner

unzvfu commented Mar 21, 2020

From data61#62:

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.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@unzvfu unzvfu

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@unzvfu