Involutions over the Galois field ${\mathbb F}_{2^{n}}$ - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE Transactions on Information Theory Year : 2016

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

Abstract

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.
No file

Dates and versions

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

Identifiers

Cite

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⟩
212 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More