Timeline for Given $i$ keyed-$PRP$ labels $\ell_{i,x}$ from a $2^{256} \times 2^{256}$ Sudoku (Latin-square), how difficult is it for an adversary to solve?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 8, 2023 at 18:21 | vote | accept | aiootp | ||
| Aug 8, 2023 at 18:02 | comment | added | aiootp | Thank you! This was extremely helpful. I found $\pi$ by accident while trying to create something that ensured a repeated plaintext block never mapped to a repeated label (ciphertext block). Which I think may be useful in some use cases, particularly contingent on if the added constraints don't lead to non-negligible predictive advantages on future labels. Also, I saw this paper examining secret sharing using Latin-squares (eprint.iacr.org/2023/333.pdf). | |
| Aug 8, 2023 at 16:51 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
More affirmative
|
| Aug 8, 2023 at 16:11 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
| Aug 8, 2023 at 16:06 | history | answered | fgrieu♦ | CC BY-SA 4.0 |