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

Field inverse #80

Closed
yelhousni opened this issue Oct 14, 2021 · 0 comments
Closed

Field inverse #80

yelhousni opened this issue Oct 14, 2021 · 0 comments
Assignees
@Tabaie
Labels
good first issue Good for newcomers perf

Comments

@yelhousni
Copy link
Collaborator

Field inverse is computing 1/x mod p. This is currently used for FFT, hash-to-curve, final exponentiation (easy part), coordinates conversion and Karabina's cyclotomic square decompression (final exp. hard part). This can also be possibly needed for BW6 Miller loop in 2-NAF (see here) and BatchAffineAddition (see #72). Particularly, for BatchAffineAddition and Karabina (see #75), the faster the field inversion is the better the the performance is.

Currently, gnark-crypto implements Algorithm 16 in [GKPP06]. Implementing this work [Pronin20] in pure Go should yield better performances.
@yelhousni yelhousni self-assigned this Oct 14, 2021
@yelhousni yelhousni mentioned this issue Oct 18, 2021
Merged
@yelhousni yelhousni removed their assignment Oct 27, 2021
@Tabaie Tabaie self-assigned this Oct 27, 2021
@gbotrel gbotrel added perf and removed new feature labels Dec 2, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@Tabaie Tabaie

Labels
good first issue Good for newcomers perf
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@gbotrel @Tabaie @yelhousni