-
Notifications
You must be signed in to change notification settings - Fork 13
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
Measure performance of exp in G, N, and N^2 #119
Merged
Merged
Conversation
This file contains 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
Signed-off-by: Denis Varlakov <[email protected]>
Crate direct depsDirect deps
Compared to base branchDiff
All depscargo tree
Compared to base branchDiff
|
The spec was successfully compiled. PDF is available here. |
Benchmark ResultBenchmarks
|
Signed-off-by: Denis Varlakov <[email protected]>
maurges
approved these changes
Nov 25, 2024
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.
In the paper, authors give estimation of performance of each protocol based on cost of point mult, and exp in$N$ , $N^2$ .
From my benchmarks on my computer:
The paper says that estimation of presigning perf is:
(if we take the highest cost per$N$ and $N^2$ )
The actual perf of presigning on my computer is 2.71s which is pretty close.
It's a bit strange that actual perf is higher than the estimation: I expected the estimation to be an upper bound of the performance as not always we do exponentiation with the highest exponent size, sometimes it's optimized with CRT, etc. Probably, perf estimation doesn't take into account some of the computations.