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.

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

Optimize GS bilinear group arithmetic #8

Open
1 of 4 tasks
jdwhite48 opened this issue Jan 31, 2022 · 0 comments
Open
1 of 4 tasks

Optimize GS bilinear group arithmetic #8

jdwhite48 opened this issue Jan 31, 2022 · 0 comments
Assignees
Labels
optimization This code could be faster

Comments

@jdwhite48
Copy link
Owner

jdwhite48 commented Jan 31, 2022

Review all of the uses of PairingEngine::pairing, ComT::pairing, and bilinear group arithmetic:

  • Store all group elements in the using the AffineCurve representation, to save on the size of group elements
  • Only perform pairing operations if neither of the operands are zero; just return Fqk::one() or ComT::zero() otherwise (I don't know if Arkworks optimizes for this already)
  • Use the multiplication function in ProjectiveCurve instead, if possible / more efficient than the one currently used in AffineCurve
  • Use the "pre-batching" techniques in [HHK '17] to reduce the number of pairings necessary to verify Groth-Sahai equations
@jdwhite48 jdwhite48 added the optimization This code could be faster label Jan 31, 2022
@jdwhite48 jdwhite48 self-assigned this Jan 31, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
optimization This code could be faster
Projects
None yet
Development

No branches or pull requests

1 participant