Timeline for Nonlinear boolean functions
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 5, 2018 at 16:01 | vote | accept | Michele | ||
| Nov 5, 2018 at 14:32 | answer | added | Jyrki Lahtonen | timeline score: 1 | |
| Nov 5, 2018 at 13:55 | comment | added | Michele | @JyrkiLahtonen. Yees... This seems to work, and is way simpler than the GRS construction pointed to by Kodlu (whom I thank, anyway). Can you write this as an answer? Also if you have any suggestion on ways to make it more efficient, I would greatly appreciate it. | |
| Nov 3, 2018 at 10:53 | history | edited | Michele | CC BY-SA 4.0 |
Question edited so as to avoid trivial answers based on taking an exponential large $m$. Also I have made clear that I am interested in an algorithm/construction to (effectively) build $f$. Same question posted on cryptostackexchange <https://crypto.stackexchange.com/questions/63665/finding-nonline>
|
| Nov 2, 2018 at 22:14 | answer | added | kodlu | timeline score: 1 | |
| Nov 2, 2018 at 21:57 | comment | added | Michele | I do not fix n-1 members, as I require that the property holds for each set $S$ (I changed for any to for each to make this more explicit). | |
| Nov 2, 2018 at 21:56 | history | edited | Michele | CC BY-SA 4.0 |
added 1 character in body
|
| Nov 2, 2018 at 21:34 | comment | added | Gerhard Paseman | Indeed, if you fix n-1 members of the set, you have fewer than 2^{m-n+1} choices for the remaining assignment. Gerhard "Wonders About Shape Of Image" Paseman, 2018.11.02. | |
| Nov 2, 2018 at 19:56 | comment | added | Michele | @Mikhail. The structure of $F_2^n$ might come into play when spelling out the conditions on $f$ and $m$ (e.g. $m-n$ might be required to be large enough etc.). | |
| Nov 2, 2018 at 19:35 | comment | added | Mikhail Tikhomirov | The structure of $\mathbf{F}_2^n$ is not important, is it? As it is written now, we could talk about a subset of $\mathbf{F}_2^m$ or size $2^n$ instead of $\mathrm{Im} f$ just the same. | |
| Nov 2, 2018 at 19:22 | history | asked | Michele | CC BY-SA 4.0 |