Timeline for Linear cryptanalysis and number of linear approximations
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 14, 2018 at 8:02 | vote | accept | CommunityBot | ||
| May 13, 2018 at 21:56 | answer | added | kodlu | timeline score: 1 | |
| May 13, 2018 at 19:33 | history | tweeted | twitter.com/StackCrypto/status/995748927713488896 | ||
| May 13, 2018 at 17:08 | comment | added | Future Security | Two thoughts. (Sorry not a good day for math) 1. The difference between $2^x-1$ and $2^x$ isn't much for most $x$. 2. If the coefficients of an input bit is zero for all output bits then your linear approximation is definitely not invertible, like a block cipher should be. A similar argument probably applies to the inverse. I'm thinking of an n by m matrix of zeros and ones as a representation of a linear XOR function. A row of all zeros or column of all zeros might correspond the $-\space1$s. There are more non-invertible matrices though, so I think it's just an upper bound. | |
| May 13, 2018 at 14:34 | review | First posts | |||
| May 13, 2018 at 17:28 | |||||
| May 13, 2018 at 14:33 | history | asked | user58612 | CC BY-SA 4.0 |