Construction of Irreducible, Normal and Primitive Polynomials over Finite Fields

Authors

  • Melsik Kyureghyan Institute for Informatics and Automation Problems of NAS RA

Abstract

  

References

M. K. Kyuregyan and G. M Kyureghyan. Irreducible compositions of polynomials over finite fields, ArXiv: 1008.18637v1 [math.NT] 11 August 2010. Accepted for publication in Designs, Codes and Cryptography, an International Journal, Editors-in-Chief: D. Jungnickel; J.D. Key; P. Wild.

M. K. Kyuregyan. “Iterated constructions of irreducible polynomials over finite fields with linearly independent roots”, j. Finite Fields and Their Applications, vol. 10, issue 3 (2004), pp. 323-341.

Khachatrian G., Kyuregyan M., New Public Key Encryption and Signature Scheme. Proceedings of Russian-German- Armenian Workshop Applications of Information Theory, Coding and Security. Yerevan, Armenia April 14-16, 2010 pp. 31-34. http://ipia.sci.am/web/WAITSC2010.htm

J. L. Massey, G. H. Khachatrian and M. K. Kuregian, Nomination of SAFER+ as Candidate algorithm for the Advanced Encryption Standard (AES), Submission document from Cylink Corporation to NIST, June 1998.

J. L. Massey, G. H. Khachatrian and M. K. Kuregian, Nomination of SAFER++ as Candidate Algorithm for the New European Schemes for Signatures, Integrity, and Encryption (NESSIE), Submission document from Cylink Corporation, 2000.

Downloads

Published

2021-12-10

How to Cite

Kyureghyan, M. . (2021). Construction of Irreducible, Normal and Primitive Polynomials over Finite Fields. Mathematical Problems of Computer Science, 34, 31–32. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/313