RPO STARK-based signature scheme verification in MASM #1591
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
fix: cleanup and restore security parameters chore: lower num of fri queries and small edits chore: cleanup chore: cleanup
fix: cleanup and restore security parameters chore: lower num of fri queries and small edits chore: cleanup chore: cleanup
Al-Kindi-0
force-pushed
the
al-stark-signature-masm
branch
from
ae1e8ba to
1ba8cf7
Compare
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.
As the title says, this is an implementation of the verification algorithm for the RPO STARK-based signature scheme as presented here. The main difference is that the current implementation is based on the conjectured security of the toy problem of the ethSTARK paper. Under this conjecture, the following implementation achieves at least 100bits of security.
The main things that are still missing:
rcomb_baseinstruction to work with extension field elements.The cycle count, assuming we introduce the instruction in point 2 above, is less than 30000 cycles.