In the thesis a new way of checking whether a function is CCZ-equivalent to a permutation is given. The results for known families of almost perfect nonlinear (APN) functions are presented for functions defined over GF(2n ), for even n ≤ 12. The ways how to reduce the number of polynomials from each family are studied. For functions of the form x3 + a-1 tr1(a3 x9 ) it is shown, that they cannot be CCZ-equivalent to a permutation on fields GF(24n ) for n ∈ ℕ .
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:388600 |
| Date | January 2018 |
| Creators | Pavlů, Jiří |
| Contributors | Göloglu, Faruk, Drápal, Aleš |
| Source Sets | Czech ETDs |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0023 seconds