Relationships between CCZ and EA equivalence classes and corresponding code invariants
Horadam, Kathy J. (Royal Melbourne Institute of Technology (Australia))
Villanueva, M. (Mercè)
(Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
Imprint: |
Springer 2014 |
Description: |
15 p. |
Abstract: |
The purpose of this paper is to provide a brief survey of CCZ and EA equivalence for functions f : G → N where G and N are finite and N is m abelian, and, for the case f : Z_p^m→ Z_p^m, to investigate two codes derived from f, inspired by these equivalences. In particular we show the dimension of the kernel of each code determines a new invariant of the corresponding equivalence class. We present computational results for p=2 and small m. |
Note: |
Llibre publicat amb motiu de la 8th International Conference, Melbourne, VIC, Australia, November 24-28, 2014 |
Rights: |
Tots els drets reservats. |
Language: |
Anglès |
Series: |
Lecture Notes in Computer Science ; 8865 |
Document: |
Capítol de llibre ; Versió acceptada per publicar |
Subject: |
EA-equivalence class ;
CCZ equivalence class ;
Code invariant ;
APN function ;
Differential cryptanalysis |
Published in: |
Sequences and Their Applications SETA, 2014, p. 3-17, ISBN 978-3-319-12324-0 |
DOI: 10.1007/978-3-319-12325-7_1
The record appears in these collections:
Research literature >
UAB research groups literature >
Research Centres and Groups (research output) >
Engineering >
Combinatorics, Coding and Security Group (CCSG)Books and collections >
Book chapters
Record created 2015-11-05, last modified 2023-02-15