dc.contributor.author | Kaleyski, Nikolay Stoyanov | |
dc.date.accessioned | 2022-03-22T12:10:47Z | |
dc.date.available | 2022-03-22T12:10:47Z | |
dc.date.created | 2022-01-26T21:38:44Z | |
dc.date.issued | 2022 | |
dc.identifier.issn | 1936-2447 | |
dc.identifier.uri | https://hdl.handle.net/11250/2986803 | |
dc.description.abstract | We define a family of efficiently computable invariants for (n,m)-functions under EA-equivalence, and observe that, unlike the known invariants such as the differential spectrum, algebraic degree, and extended Walsh spectrum, in the case of quadratic APN functions over \(\mathbb {F}_{2^n}\) with n even, these invariants take on many different values for functions belonging to distinct equivalence classes. We show how the values of these invariants can be used constructively to implement a test for EA-equivalence of functions from \(\mathbb {F}_{2}^{n}\) to \(\mathbb {F}_{2}^{m}\); to the best of our knowledge, this is the first algorithm for deciding EA-equivalence without resorting to testing the equivalence of associated linear codes. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Springer | en_US |
dc.rights | Navngivelse 4.0 Internasjonal | * |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/deed.no | * |
dc.title | Deciding EA-equivalence via invariants | en_US |
dc.type | Journal article | en_US |
dc.type | Peer reviewed | en_US |
dc.description.version | publishedVersion | en_US |
dc.rights.holder | Copyright 2021 The Author(s) | en_US |
cristin.ispublished | true | |
cristin.fulltext | postprint | |
cristin.qualitycode | 1 | |
dc.identifier.doi | 10.1007/s12095-021-00513-y | |
dc.identifier.cristin | 1990815 | |
dc.source.journal | Cryptography and Communications | en_US |
dc.source.pagenumber | 271–290 | en_US |
dc.identifier.citation | Cryptography and Communications. 2022, 14, 271–290 | en_US |
dc.source.volume | 14 | en_US |