mirror of
https://github.com/serai-dex/serai.git
synced 2024-09-29 01:41:28 +00:00
6fec95b1a7
This could still be gamed. For [1, 2, 3], the options were ([1], [2, 3]) or ([1, 2], [3]). This means 2 would always have the maximum round count, and thus this is still game-able. There's no point to keeping its complexity accordingly when the algorithm is as efficient as it is. While a proper random could be used to satisfy 3.7.2, it'd break the expected determinism. |
||
|---|---|---|
| .. | ||
| ciphersuite | ||
| dalek-ff-group | ||
| dkg | ||
| dleq | ||
| ed448 | ||
| ff-group-tests | ||
| frost | ||
| multiexp | ||
| schnorr | ||
| transcript | ||