Improve description of Dilithium #40
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
kriskwiatkowski
force-pushed
the
kris/dilithium
branch
2 times, most recently
from
7650dd3 to
da8160d
Compare
auriee
requested changes
Feb 6, 2024
| @@ -460,7 +464,13 @@ Understanding EUF-CMA security is essential for individual involved in designing | |||
|
|
|||
| ## Details of FALCON, Dilithium, and SPHINCS+ {#sig-scheme} | |||
|
|
|||
| Dilithium [Dilithium] is a digital signature algorithm (part of the CRYSTALS suite) based on the hardness lattice problems over module lattices (i.e., the Module Learning with Errors problem (MLWE)). The design of the algorithm is based on the "Fiat Shamir with Aborts" method that leverages rejection sampling to render lattice based FS schemes compact and secure. Additionally, Dilithium offers both deterministic and randomized signing. Security properties of Dilithium are discussed in Section 9 of {{?I-D.ietf-lamps-dilithium-certificates}}. | |||
| Dilithium [Dilithium] is a digital signature algorithm (part of the CRYSTALS suite) based on the hardness lattice problems over module lattices (i.e., the Module Learning with Errors problem (MLWE)). The design of the algorithm is based on the "Fiat-Shamir with Aborts" {{Lyu09}} framework introduced by Lyubashevsky, that leverages rejection sampling to render lattice based FS schemes compact and secure. The public key of Dilithium is essentially a Module‐LWE sample of the form (A, t:=A·s1 + s2), where A is a matrix and s1 and s2 are (secret) error vectors over Rq = GF(q)[X]/(X^256+1), where q=8380417. Dilithium uses uniform distribution over small integers for computing coefficients in error vectors, which makes the scheme easier to implement. | |||
|
|
|||
There was a problem hiding this comment.
@kriskwiatkowski Thanks for updating the paragraph.
We tried before explaining the math behind Dilithium but received feedback from WG to stir away from the crypto math behind these algorithms as this would not be necessary to know from an engineer/protocol designer POV. Let me know if you can you modify it to include a little bit less math, if possible?
There was a problem hiding this comment.
Yes, that's a reply I kind of expected.
I'm happy to do it, let me think about it
There was a problem hiding this comment.
Ok, slight improvement then. I've removed all the math. Anyone can be find it in the Lyu09 if needed
kriskwiatkowski
force-pushed
the
kris/dilithium
branch
from
78163bb to
3c67824
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.
I suggest to augment description of Dilithium/MLDSA.