Involutions over the Galois field ${\mathbb F}_{2^{n}}$ - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Information Theory Année : 2016

Involutions over the Galois field ${\mathbb F}_{2^{n}}$

Résumé

An involution is a permutation such that its inverse is itself (i.e., cycle length less than 2). Due to this property involutions have been used in many applications including cryptography and coding theory. In this paper we provide a systematic study of involutions that are defined over finite field of characteristic 2. We characterize the involution property of several classes of polynomials and propose several constructions. Further we study the number of fixed points of involutions which is a pertinent question related to permutations with short cycle. In this paper we mostly have used combinatorial techniques.
Fichier non déposé

Dates et versions

hal-01272943 , version 1 (11-02-2016)

Identifiants

Citer

Pascale Charpin, Sihem Mesnager, Sumanta Sarkar. Involutions over the Galois field ${\mathbb F}_{2^{n}}$. IEEE Transactions on Information Theory, 2016, 62 (4), ⟨10.1109/TIT.2016.2526022⟩. ⟨hal-01272943⟩
208 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More