dc.contributor.author | Budaghyan, Lilya | |
dc.contributor.author | Calderini, Marco | |
dc.contributor.author | Carlet, Claude | |
dc.contributor.author | Coulter, Robert | |
dc.contributor.author | Villa, Irene | |
dc.date.accessioned | 2021-05-25T09:35:28Z | |
dc.date.available | 2021-05-25T09:35:28Z | |
dc.date.created | 2021-01-10T15:03:01Z | |
dc.date.issued | 2020 | |
dc.identifier.issn | 0018-9448 | |
dc.identifier.uri | https://hdl.handle.net/11250/2756217 | |
dc.description.abstract | Almost perfect nonlinear (APN) functions over fields of characteristic 2 play an important role in cryptography, coding theory and, more generally, mathematics and information theory. In this paper we deduce a new method for constructing APN functions by studying the isotopic equivalence, concept defined for quadratic planar functions in fields of odd characteristic. In particular, we construct a family of quadratic APN functions which provides a new example of an APN mapping over F 29 and includes an example of another APN function x 9 + Tr(x 3 ) over F 28 , known since 2006 and not classified up to now. We conjecture that the conditions for this family are satisfied by infinitely many APN functions. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | IEEE | en_US |
dc.title | Constructing APN functions through isotopic shifts | en_US |
dc.type | Journal article | en_US |
dc.type | Peer reviewed | en_US |
dc.description.version | acceptedVersion | en_US |
dc.rights.holder | Copyright 2020 IEEE | en_US |
cristin.ispublished | true | |
cristin.fulltext | postprint | |
cristin.qualitycode | 2 | |
dc.identifier.doi | 10.1109/TIT.2020.2974471 | |
dc.identifier.cristin | 1868332 | |
dc.source.journal | IEEE Transactions on Information Theory | en_US |
dc.source.pagenumber | 5299 - 5309 | en_US |
dc.identifier.citation | IEEE Transactions on Information Theory. 2020, 66(8), 5299 - 5309 | en_US |
dc.source.volume | 66 | en_US |
dc.source.issue | 8 | en_US |