See All News
Melsik Kyureghyan
Position: Leading Scientific Researcher, Head of Direction

Phone: (+374 60) 623541
E-mail: melsik@ipia.sci.am




  Research Interests

Cryptography, Finite Field Theory, Coding Theory, Number Theory, Computing Algebra

 
  Education

YSU, Department of Applied Mathematics

 
  Titles, Degree

PhD in physical and mathematical sciences
 
  Professional Experience

Head of Department   Department of InformationCoding   and Cryptography IIAPNAS RA, (since 2000)
Scientific Advisor,
Chief  Cryptologis
  Hylink JSC, Yerevan, Armenia (since 1992)
Senior researcher   IIAP of NAS RA, senior researcher
(1984-1999)
Engineer   Institute of Mathematical Machines
(Computers) RA (1976-1984)
 
  Selected Publications

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.
 
News
2019թ. մայիսի 22-ին ժ. 14:00-ին Ինֆորմատիկայի և ավտոմատացման պրոբլեմների ինստիտուտում (4-րդ հարկ, սեմինարների սենյակ) անցկացվելու են գիտական քննարկումներ Թուլուզի Ինֆորմատիկայի հետազոտությունների ինստիտուտի (IRIT) գիտնականների հետ՝ 
Jean-Pierre JESSEL, Alain Crouzil:
Բոլոր ցանկացողները հրավիրվում են մասնակցելու: 



On May 24, 2019 at 15:00
the general seminar of IIAP will be held.

On the agenda there is the report of David Sargsyan on «Դիսկրետ կոմբինատոր խնդիրներ վերջավոր դաշտերում».



The graded test in Informatics for PhD applicants
will take place on May 29, 2019 at 10:00 in the Institute for Informatics and Automation Problems (Room 333). 



The qualifying test in Informatics for PhD students
will take place on May 30, 2019 at 10:00 in the Institute for Informatics and Automation Problems (Room 333).



                                                           
CONTACTS
  • 0014, Yerevan, Republic of Armenia, 1, P. Sevak str.
  • Phone: (+37410) 28-20-30
  • Fax: (+37410) 28-20-50
  • E-mail: ipia@ipia.sci.am
ABOUT INSTITUTE
SCIENTIFIC ACTIVITY
EDUCATION