Iterated constructions of irreducible polynomials over finite fields with linearly independent roots. - Melsik K. Kyuregyan (Finite Fields Their Appl., 2004)

Monotonicity checking. - Melsik K. Kyuregyan (Electron. Notes Discret. Math., 2005)

Recurrent methods for constructing irreducible polynomials over Fq of odd characteristics, II. - Melsik K. Kyuregyan (Finite Fields Their Appl., 2006)

Recursive constructions of N-polynomials over GF(2s). - Melsik K. Kyuregyan (Discret. Appl. Math., 2008)

A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields. - Sergey Abrahamyan; Melsik Kyureghyan (CASC, 2011)

Irreducible compositions of polynomials over finite fields. - Melsik K. Kyuregyan; Gohar M. Kyureghyan (Des. Codes Cryptogr., 2011)

Irreducible compositions of polynomials over finite fields of even characteristic. - Saeid Mehrabi; Melsik K. Kyuregyan (Appl. Algebra Eng. Commun. Comput., 2012)

Recursive constructions of irreducible polynomials over finite fields. - Sergey Abrahamyan; Mahmood Alizadeh; Melsik Kyureghyan (Finite Fields Their Appl., 2012)

Construction of irreducible. - Melsik K. Kyuregyan (Handbook of Finite Fields, 2013)

A New Public Key Encryption System Based on Permutation Polynomials. - Gurgen H. Khachatrian; Melsik Kyureghyan (IC2E, 2014)

Permutation polynomials and a new public-key encryption. - Gurgen H. Khachatrian; Melsik Kyureghyan (Discret. Appl. Math., 2017)

A recurrent construction of irreducible polynomials of fixed degree over finite fields. - Gohar M. Kyureghyan; Melsik K. Kyuregyan (Appl. Algebra Eng. Commun. Comput., 2022)