Rusydi Makarim
 Full Name
 R.H. Makarim
 Function(s)
 PhD student
 R.H.Makarim@cwi.nl
 Telephone
 +31 20 592 4012
 Room
 M264
 Department(s)
 Cryptology
 Homepage
 http://pub.math.leidenuniv.nl/~makarimrh/
Biography
I am an ALGANT PhD student at Mathematisch Instituut, Universiteit Leiden and Cryptology Research Group, Centrum Wiskunde en Informatica (CWI). My PhD research deals with developing new techniques to solve a system of multivariate polynomial equations over a finite field and its application in cryptanalysis. My promotor is Ronald Cramer and my supervisor is Marc Stevens.Research
My research primarily focuses on developing algebraic techniques to find a solution for a system of multivariate polynomial equations over a finite field. One of the main approach to solve such system is by computing a Groebner basis of its corresponding polynomial ideal. This approach, which was originally proposed in 1965, is considered to be the most wellstudied computational technique to solve multivariate polynomial systems. Moreover with the advent of multivariatebased public key cryptography as a candidate for postquantum cryptography, it is critical to understand how Groebner bases algorithms behave against algebraically constructed system of polynomial equations.
Publications

Utomo, P.H, & Makarim, R.H. (2017). Solving a binary puzzle. Mathematics in Computer Science, 11(34), 515–526. doi:10.1007/s1178601703224

Makarim, R.H, & Stevens, M.M.J. (2017). M4GB: An efficient Gröbnerbasis algorithm. In Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC (pp. 293–300). doi:10.1145/3087604.3087638
Current projects with external funding

Algebraic Methods for Stronger Crypto (ALGSTRONGCRYPTO)