On permutation polynomials modulo 7n
*P. L. SharmaCorresponding authorplsharma1964@gmail.comDepartment of Mathematics & Statistics H. P. UniversityShimla, Himachal Pradesh, 171005, IndiaView full profile → , Sushil Kumarsushilkumar16n@gmail.comDepartment of Mathematics & Statistics H. P. UniversityShimla, Himachal Pradesh, 110063, IndiaView full profile → , AshimaDepartment of Mathematics Hansraj College University of DelhiDelhi, IndiaView full profile → , Neetu Dhimandhimanneetu278@gmail.comDepartment of Applied Sciences & Humanities University Institute of Technology H. P. UniversityUniversity Institute of Technology Himachal Pradesh UniversityShimla, Himachal Pradesh, 171005, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 16 Feb 2022
- Accepted:
- 10 Aug 2022
- Published Online:
- 16 Sep 2024
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-1671
- Pages:
- 1743–1751
Abstract
Keywords
Subject Classifications
References
[1] Dickson L. E., The analytic representation of substitutions on a power of a prime number of letters with a discussion of the linear group, part I, Ann. of Math. 11, 65-120, 1896-1897.
[2] Hardy G. H. and Wright E. M., An introduction to the theory of numbers, Oxford Science Publications, 5th edition, 1979.
[3] Lidl R., On cryptosystems based on permutation polynomials and finite fields, In Advanced in Cryptology-Euro Crypt 1984, Lecture Notes in Computer Science, 209, 10-15, 1985.
[4] Lidl R. and Mullen G. L., When does a polynomial over a finite field permute the elements of the field? The American Math. Monthly, 95 (3), 243-246, 1988.
[5] Lidl R. and Mullen G. L., When does a polynomial over a finite field permute the elements of the field? II The American Math. Monthly, 100 (1), 71-74, 1993.
[6] Lidl R. and Muller W. B., Permutation polynomials in RSA-cryptosystem, In Proc. CRYPTO, New York, Plennum Press, 83, 293-301, 1948.
[7] Lidl R. and Niederreiter H., Finite Fields, Encyclopedia of Mathematics and its Application, Addision-Wesley, Reading, MA. 20 1983.
[8] Mollin R. A. and Small C., On permutation polynomial over finite fields, Internat. J. Math. & Math. Sci., 10 (3), 535-544, 1948.
[9] Mullen G. L., Permutation polynomial and nonsingular feedback shift registers over finite fields, IEEE Trans. Information Theory, 35 (4), 900-902, 1989.
[10] Mullen G. L. and Panario D., Hanbook of Finite Fields, Discrete Mathematics and its Application, CRC Press, Taylor & Francis Group, 2013.
[11] Rivest R. L., Permutation polynomial modulo 2w Finite Fields and Their Applications, 7, 287-292, 2001.
[12] Sharma P. L. and Ashima, Construction of irreducible polynomials over finite fields, Asian-European Journal of Mathematics, 15(7), 2250130, 2022.
[13] Sharma P. L., Ashima and Sharma A. K., Recursive construction of normal polynomials over finite fields, Journal of Discrete Mathematical Sciences and Cryptography, Published online, https://doi.org/10.1080/0970529.2021.1897215.
[14] Sharma P. L., Rehan M. and Sharma S., Counting irreducible polynomial polynomials over GF(3) with first and third coefficients given, Asian-European Journal of Mathematics, 8 (1), 1550015 (27 Pages), 2015.
[15] Sharma P. L., Sharma S. and Rehan M., On construction of irreducible polynomials over F3 Journal of Discrete Mathematical Sciences and Cryptography, 18 (4), 335-347, 2015.
[16] Singh R. P. and Maity S., Permutation polynomials modulo pn Accessed: Sep. 20, 2016. [Online]. Available: https://eprint.iacr.org/2009/ 393.pdf
[17] Trifina L. and Tarniceriu D., A coefficient test for fourth degree permutation polynomials over integer rings, AEU-Int. J. Electron. Commun., 70 (11), 1565-1568, 2016.
[18] Trifina L. and Tarniceriu D., A coefficient test for quintic permutation polynomials over integer rings, IEEE Access, 6, 37893-37909, 2018.
[19] Wang L., On permutation polynomials, Finite Fields and Their Applications, 8, 311-322, 2002.
