Construction of Irreducible, Normal and Primitive Polynomials over Finite Fields
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
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.