Constant-time heap-allocated Bernstein-Yang #635
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
3 tasks
The previous implementation runs in variable-time with respect to `g`. However in the event both inputs are secret a fully constant-time implementation is required. This implements Bernstein-Yang in constant-time with respect to both parameters by computing a worst case number of iterations for the algorithm to converge, partially sharing the implementation with #632.
tarcieri
force-pushed
the
boxed-bernstein-yang-constant-time
branch
from
d4a65e3 to
f3e3e8b
Compare
Merged
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
The previous implementation runs in variable-time with respect to
g. However in the event both inputs are secret a fully constant-time implementation is required.This implements Bernstein-Yang in constant-time with respect to both parameters by computing a worst case number of iterations for the algorithm to converge, partially sharing the implementation with #632.