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

Montgomery reduction for complex number exponentiation #20

Open
ValarDragon opened this issue Mar 12, 2018 · 1 comment
Open

Montgomery reduction for complex number exponentiation #20

ValarDragon opened this issue Mar 12, 2018 · 1 comment

Comments

@ValarDragon
Copy link
Member

Unmarshalling compressed G2 points can be sped up by using the montgomery reduction in that exponentiation.
@ValarDragon
Copy link
Member Author

ValarDragon commented Apr 7, 2018 •
edited
Loading

Perhaps use https://cr.yp.to/papers/pippenger.pdf for an even faster exponentiation algorithm. See zcash issue 3128 for a potential discussion to see if this can be done in a side channel resistant manner.

(Not using a link to avoid a reference link showing up there, since this doesn't contribute to solving that problem)

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