🧮 Utilize optimized encryption equations #452
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
keithrfung
changed the title
axman6
added a commit
to axman6/ElectionGuard
that referenced
this pull request
Oct 2, 2021
keithrfung
added
hacktoberfest
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Issue
Fixes #411
Description
Changed the computation of the Chaum-Pederson proofs to more efficient versions saving two modular exponentiations per proof. Still computes the exact same proofs and verification stays the same.
(Note, there is a typo in the Word document that is attached to the issue: the alternative for the proof of an encryption of zero needs to compute
v1 = (v + c1*R) mod q.)Testing
Run Chaum-Pedersen tests.