See All News
Yeghisabet Alaverdyan
Position: Associate Professor, National Polytechnic University of Armenia, faculty of Computing Science and Informatics

Phone: (+374 93) 524831
E-mail: ealaverdyan@gmail.com




  Research Interests

Cryptography and Coding Theory

 
  Education

Erevan Polytechnic Institute (now NPUA)
Specialization: System Engineer

 
  Titles, Degree

PhD

 
  Professional Experience

Engineer   Central Telegraph (1980-1986)

Head of Computing Complex   Central Telegraph, Yerevan  (1986-1995)

Network Engineer and 
System programmer

  “Info-Com” CJSC,Yerevan (1995 - 2003)
Lecturer   European Regional Educational Academy,
Yerevan (2003-2012)

Associate Professor   National Polytechnic University of Armenia,
Faculty of Computing Science and Informatics,
ISSD Department (2012- present)
 
  Selected Publications

Y. Alaverdyan, G. Margarov. Partition and Colouring in Design of Quasigroup Equipped Error-Detecting Codes. – Mathematical Problems of Computer Science. In Transactions of the Institute for Informatics and Automation Problems of NAS of the RA., Yerevan, 2012.

Y. Alaverdyan. Efficiency of Generating Highly Nonlinear Boolean Permutations over Quasigroups. -  Annual Session of the Armenian Mathematical Union, YSU, Yerevan, 2013.  

Y. Alaverdyan. Graph based Orthogonal Quasigroups in Design of Error Correcting Codes. - Annual Session of the Armenian Mathematical Union, devoted to the 90th Anniversary of Rafael Alexandryan, YSU, Yerevan, 2013.

G. Margarov, Y. Alaverdyan. Non Associative Algebraic Structures Embedded Fast Public Key Cryptosystem based on Boolean Product of Matrices. In Proc. of the Workshop on Applications of Information Theory, Coding and Security, Yerevan, Armenia, April, 2010.

Y. Alaverdyan, G. Margarov․ Quasigroup Equipped Strong Public Key Cryptosystem based on Boolean Product of Matrices. The 2010 World Congress in Computer Science, July, 2010, Las Vegas, Nevada, USA.

Y. Alaverdyan. Construction Efficiency of the Public Key Cryptosystem based on Boolean Product of Matrices. In Proc. of the 7th International Conference on Computer Science and Information Technologies, 2009, Yerevan, Armenia.

G. Margarov, S. Chopuryan, Y. Alaverdyan. Cryptanalysis of Finite Automata Public Key Cryptosystems. The 2009 World Congress in Computer Science, July, 2009, Las Vegas, Nevada, USA.

G. Margarov, Y. Alaverdyan. Stability of the Public Key Cryptosystem based on Boolean Product of Matrices. In Proc. Of the Second Int’ Conf. on the Applications of Digital Info. & Web Technologies, August, 2009, IEEE Catalog, London, UK.

G. Margarov, Y. Alaverdyan. Fast asymmetric cryptosystem based on Boolean product of matrices. - The 7th ACS/IEEE International Conference on Computer Systems and Applications, AICCSA’2009. May 10-13, 2009, Rabat, Morocco

 
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