You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Try to avoid O(n²) algorithm for finding of second unique key
Add more test vectors (in particular, test vectors that result in failure).
Add proper design and motivation section.
Mention that sorting the keys is optional and why.
Improve nonce derivation.
As specified right now, if the output of the RNG used as the secret nonce ever repeats, the secret key leaks immediately. It is possible to (slightly) reduce the possibility of nonce reuse by deriving the secret nonce from the RNG output, aggregate public key and message.
Mention "counter mode" nonce derivation, i.e. deriving from secret key and non-repeating counter.
The text was updated successfully, but these errors were encountered: