3.7 | A new term for the twisted Edwards group | 0 |
5.2.2 | The randomizer range is not one rule | 0 |
5.3.5 | EdDSA verification has its own clause | 0 |
6.1 | Twelve mechanisms, three arithmetic settings | 0 |
6.12.5.7 | Why the new clause sits after SM2 | 0 |
6.13.1 | EdDSA enters as its own mechanism | 0 |
6.13.2 | Two parameter sets, and they do not mix | 0 |
6.13.3 | Key generation, and two different clamping rules | 0 |
6.13.4.1 | The randomizer is derived, not drawn | 0 |
6.13.4.2 | The pre-signature is one scalar multiple | 0 |
6.13.4.3 | One message part is empty by design | 0 |
6.13.4.4 | The witness is an encoded point | 0 |
6.13.4.5 | The assignment binds the key into the hash | 0 |
6.13.4.6 | The second part fits a fixed octet length | 0 |
6.13.4.7 | What the appendix carries | 0 |
6.13.4.8 | The signed message is the message plus the appendix | 0 |
6.13.5.1 | Verification acquires its inputs first | 0 |
6.13.5.2 | Decode, range check, then verify | 0 |
6.13.5.3 | The verifier splits the message the same way | 0 |
6.13.5.4 | The assignment is recomputed, not trusted | 0 |
6.13.5.5 | The group equation, with the curve parameters in hand | 0 |
6.3.2 | KCDSA: the pair, the hash and the strength | 0 |
6.5.2 | SDSA: three sizes, one strength rule | 0 |
6.6.1 | EC-DSA: the hash list is closed | 0 |
Annex A | Object identifiers are replaced, including two new curves | 0 |
Annex B | Point encoding and decoding for EdDSA | 0 |
Annex F | Worked examples for both parameter sets | 0 |
Annex G | The comparison table now includes EdDSA | 0 |
Annex H | Claimed features, and what a claim is worth | 0 |
Clause 2 | One normative reference is added | 0 |
Clause 4 | Symbols for the third arithmetic setting | 0 |
Introduction, Note 4 | The mechanism count becomes fifteen | 0 |
Introduction, Note 5 | The key substitution warning is reworded | 0 |