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

Optimize square root implementation for Fq #50

Open
daira opened this issue Aug 8, 2021 · 1 comment
Open

Optimize square root implementation for Fq #50

daira opened this issue Aug 8, 2021 · 1 comment

Comments

@daira
Copy link
Contributor

daira commented Aug 8, 2021 •
edited

Suggested by @str4d:

The Sarkar algorithm used in the Pasta implementation is applicable to Fq since it is highly 2-adic. (Fr is not, but optimizing Fq square roots is more important for Jubjub curve point decompression, and therefore for Sapling trial decryption; see zcash/librustzcash#423 (comment) ).
@ashWhiteHat
Copy link

It seems this closed by zkcrypto/bls12_381#100

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
2 participants
@daira @ashWhiteHat