G.Khachatrian, M.Kuregian, K.Ispirian, J.Massey, “Fast Multiplication of Integers for Public-Key Cryptosystems” - Lecture Notes in Computer Science. Selected Areas in Cryptography, LNSC 2259, Toronto, (2001), 245-254. 

M. K. Kyuregyan., “Recurrent methods for constructing irreducible polynomials over  ”, j. Finite Fields and Their Applications, vol. 8, N1, January (2002), pp. 52-68.

M. K. Kyuregyan, “Recurrent methods for constructing irreducible polynomials over of odd characteristics”, j. Finite Fields and Their Applications, vol. 9, issue 1 (2003), pp. 39-58.

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.

M. K. Kyuregyan, “Recursive constructions of N-polynomials over GF(2s)”, Discrete Applied Mathematics, 156(2008) 1554-1559. Also included in an extra volume of abstracts published in the collection Electronic Notes in Discrete Mathematics(ENDM) 21(2005) 343. 

M. K. Kyuregyan, “Recurrent methods for constructing irreducible polynomials over   of odd characteristics”, II.  j. Finite Fields and Their Applications, vol.12, issue 3, 2006, pp. 357-378 .

M. Kyuregyan and G. Kyuregyan. "Irreducible Compositions of Polynomials over Finite Fields", Design, Codes and Cryptography, vol. 61, no. 3, 301-314, (2011).  

Abrahamyan S., Kyuregyan M., A recurrent method for constructing irreducible polynomials over finite fields, 13th International Workshop, CASC 2011, Kassel, Germany, September 5-9, 2011, Proceedings.  Lecture Notes in Computer Science, vol. 6885, pp. 1-10, 2011.

Abrahamyan S., Alizadeh M., Kyuregyan M., Recursive constructions of irreducible polynomials over finite fields. Finite Fields Appl. 18(2012), pp. 738-745. 

Melsik Kyuregyan, chapter Construction of irreducible in  Handbook of Finite Fields, ed. by Gary L. Mullen, Daniel Panarino, Chapman and Hall/CRC, 2013,  1068pages. Series: Discrete Mathematics and its Applications.