Adjunct Lecturer
Sergey Abrahamyan is of 9+ years experienced researcher at the Institute for Informatics and Automation Problems. His research interests include cryptography, coding theory, number theory, finite fields theory, and cybersecurity.
Higher Education
2012, PhD in Mathematics
National Academy of Sciences of RA
2007, Master in Informatics and Applied Mathematics
Yerevan State University
2003, Bachelor of Mathematics
Yerevan State University
Courses taught:
- Coding Theory
- Cryptography
Publications:
- 2020 S. Abrahamyan, A. Zakaryan. A Solution for Preventing the Rogue Certificate Attack. Mathematical Problems of Computer Science, volume 53, 2020 pages 49-56.
- 2019 G. Khachatrian, S. Abrahamyan. Towards Secure and Efficient “white-box" Encryption. Journal of Universal Computer Science, volume 25, number 8, 2019, pages 868-886.
- 2015 S. Abrahamyan, M. Kyureghyan. New Recursive Construction of normal polynomials over Finite Fields. Proceedings of the 11th International Conference on Finite Fields and Their Applications, Magdeburg, Germany, 2013, Contemporary Mathematics 632, pages 1-10, 2015.
Office location: 335W/PAB
Office hours: Friday- 13:45-15:45