Timeline for Is it reasonable to assume that $\text{Keccak-}f[25n]$ block permutation is defined for any value of $n$?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 22, 2018 at 13:04 | comment | added | Aleph | @lyricallywicked Yes, it's incorrect or at least inaccurate. It should mention $\ell \le 6$. | |
| Dec 22, 2018 at 10:33 | comment | added | lyrically wicked | But if there does not exist an universal definition of this permutation for any power-of-two word size, then that quoted claim in Wikipedia is not correct? | |
| Dec 19, 2018 at 10:46 | comment | added | Aleph | @Ruggero I agree, that's the reason for my last paragraph. I took the question to be mostly about well-definedness (not security). | |
| Dec 19, 2018 at 10:42 | comment | added | Ruggero | I tend to believe that the values chosen for the $\rho$ operation (e.g. a maximum of 300) won't work well from a security standpoint when the lane size is extended to be significantly larger. | |
| Dec 19, 2018 at 5:20 | vote | accept | lyrically wicked | ||
| Dec 18, 2018 at 21:45 | history | edited | Aleph | CC BY-SA 4.0 |
added 653 characters in body
|
| Dec 18, 2018 at 21:36 | comment | added | Aleph | @poncho Ah, you're right. Thanks for pointing it out. I'll make some changes to take this into account. | |
| Dec 18, 2018 at 21:21 | comment | added | poncho | I believe that if $w$ happens to be a multiple of 15, then the $\theta$ step will not be invertible (and hence you won't end up with a permutation) | |
| Dec 18, 2018 at 19:05 | history | answered | Aleph | CC BY-SA 4.0 |