Melsik Kyureghyan

According to our database, Melsik Kyureghyan authored at least 12 papers between 2004 and 2022.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of four.

2022

A recurrent construction of irreducible polynomials of fixed degree over finite fields.

Gohar M. Kyureghyan, Melsik K. Kyuregyan

Appl. Algebra Eng. Commun. Comput., 2022

2017

Permutation polynomials and a new public-key encryption.

Gurgen H. Khachatrian, Melsik Kyureghyan

Discret. Appl. Math., 2017

2014

A New Public Key Encryption System Based on Permutation Polynomials.

Gurgen H. Khachatrian, Melsik Kyureghyan

Proceedings of the 2014 IEEE International Conference on Cloud Engineering, 2014

2013

Construction of irreducible.

Melsik K. Kyuregyan

Proceedings of the Handbook of Finite Fields., 2013

2012

Recursive constructions of irreducible polynomials over finite fields.

Sergey Abrahamyan, Mahmood Alizadeh, Melsik Kyureghyan

Finite Fields Their Appl., 2012

Irreducible compositions of polynomials over finite fields of even characteristic.

Saeid Mehrabi, Melsik K. Kyuregyan

Appl. Algebra Eng. Commun. Comput., 2012

2011

Irreducible compositions of polynomials over finite fields.

Melsik K. Kyuregyan, Gohar M. Kyureghyan

Des. Codes Cryptogr., 2011

A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields.

Sergey Abrahamyan, Melsik Kyureghyan

Proceedings of the Computer Algebra in Scientific Computing - 13th International Workshop, 2011

2006

Recurrent methods for constructing irreducible polynomials over F_q of odd characteristics, II.

Melsik K. Kyuregyan

Finite Fields Their Appl., 2006

2005

Recursive Constructions of N-polynomials over GF (2^s).

Melsik K. Kyuregyan

Electron. Notes Discret. Math., 2005

Monotonicity checking.

Melsik K. Kyuregyan

Electron. Notes Discret. Math., 2005

2004

Iterated constructions of irreducible polynomials over finite fields with linearly independent roots.

Melsik K. Kyuregyan

Finite Fields Their Appl., 2004