A class of permutation polynomials over the group ring $\mathbb{F}_pC_{p^{n}}$
DOI:
https://doi.org/10.13069/jacodesmath.v10i2.241Keywords:
Group ring, Permutation polynomialAbstract
Let $p$ be a prime number and $\mathbb{F}_pC_{p^n}$ denote the group ring of a cyclic group of order $p^n$ over $\mathbb{F}_{p}$. We study the permutation property of the polynomial $a_0 + a_1 x + a_p x^p + \cdots + a_{p^n} x^{p^n}$ with coefficients $a_i \in \mathbb{F}_pC_{p^n}$ where $i=0, 1, p, \ldots, p^n$. Necessary and sufficient conditions on the coefficients have been obtained so that it becomes a permutation polynomial.
Received: 22 February 2022 | Accepted: 18 June 2022Downloads
References
C. Ding and T. Helleseth, Optimal ternary cyclic codes from monomials, IEEE Trans. Inform. Theory 59(9) (2013) 5898–5904.
S. Frisch, Polynomial functions on finite commutative rings, in: P.-J. Cahen, D. L. Costa, M. Fontana, and S.-E. Kabbaj (Eds.), Advances in Commutative Ring Theory, Lecture Notes in Pure and Applied Mathematics, Vol. 205, Marcel Dekker, New York, 1999, pp. 323–336.
J. A. Gallian, Contemporary Abstract Algebra, 4th Edition, Narosa Publishing House, New Delhi, 2008.
J. Gildea, A. Kaya, R. Taylor, and B. Yildiz, Constructions for self-dual codes induced from group rings, Finite Fields Appl. 51 (2018) 71–92.
D. Görcsös, G. Horváth, and A. Mészáros, Permutation polynomials over finite rings, Finite Fields Appl. 49 (2018) 198–211.
R. Gupta and R. K. Sharma, Some new classes of permutation trinomials over finite fields with even characteristic, Finite Fields Appl. 41 (2016) 89–96.
R. Gupta and R. K. Sharma, Further results on permutation polynomials of the form $(x^{p^m}-x+\delta)^s+x$ over $\mathbb{F}_{p^{2m}}$, Finite Fields Appl. 50 (2018) 196–208.
R. Gupta and R. K. Sharma, On permutation polynomials over finite fields of characteristic 2, J. Algebra Appl. 15(7) (2016) 1650133.
B. Hurley and T. Hurley, Group ring cryptography, Int. J. Pure Appl. Math. 69(1) (2011) 67–86.
Y. Laigle-Chapuy, Permutation polynomials and applications to coding theory, Finite Fields Appl. 13(1) (2007) 58–70.
R. Lidl and W. B. Mullen, Permutation polynomials in RSA-Cryptosystems, in: D. Chaum (Ed.), Advances in Cryptology, Plenum Press, New York, 1984, pp. 293–301.
R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia of Mathematics and its Applications, Vol. 20, Cambridge University Press, Cambridge, 1984.
C. P. Milies and S. K. Sehgal, An Introduction to Group Rings, Algebras and Applications, Vol. 1, Kluwer Academic Publishers, Dordrecht, 2002.
R. L. Rivest, Permutation polynomials modulo $2^w$, Finite Fields Appl. 7(2) (2001) 287–292.
R. L. Rivest, M. J. B. Robshaw, R. Sidney, and Y. L. Yin, The RC6 block cipher, RSA Laboratories, 1998.
R. P. Singh and S. Maity, Permutation polynomials modulo $p^n$, Cryptology ePrint Archive, Report 2009/393, 2009.
R. P. Singh, Permutation polynomials and their applications in cryptography, Ph.D. thesis, Indian Institute of Technology Guwahati, India, 2010.
J. Schwenk and K. Huber, Public key encryption and digital signatures based on permutation polynomials, Electron. Lett. 34(8) (1998) 759–760.
G. R. Vadiraja Bhatta, B. R. Shankar, V. N. Mishra, and P. Poojary, Sequence of numbers via permutation polynomials over some finite rings, Proyecciones 39(5) (2020) 1295–1313.
