Session S26 - Finite fields and applications

Thursday, July 15, 14:30 ~ 14:50 UTC-3

Explicit Formulas for Polynomial Involutions Over Finite Fields

Ivelisse Rubio

University of Puerto Rico, Río Piedras, United States   -   This email address is being protected from spambots. You need JavaScript enabled to view it.

Permutations of finite fields play an important role in communications as they are used in applications ranging from speech encryption to coding theory and cryptography. Involutions are permutations that are its own inverse and have the advantage that the same implementation can be used for coding and decoding. We present explicit formulas for all the involutions of finite fields that are given by monomials and for their fixed points. We also present partial results on explicit formulas that produce families of binomial involutions.

Joint work with Lillian González (University of Puerto Rico, Río Piedras) and Ariane Masuda (New York City College of Technology, The City University of New York (CUNY)).

View abstract PDF