...

Rusydi H. Makarim

Cryptography & Cryptanalysis Engineer

Rusydi Makarim is a Cryptography and Cryptanalysis Engineer. His current research focuses on the design and the cryptanalysis of symmetric-key primitives. He is currently working at KriptografID while pursuing another PhD at the Department of Digital Security, Radboud University Nijmegen, supervised by Joan Daemen and Håvard Raddum. Previously he worked as a Lead Cryptography Analyst at the Cryptography Research Centre, Technology Innotation Institute (TII). Prior to that, he was a PhD student at the Mathematical Institute, Leiden University and CWI Cryptology Group, working on the development of a Gröbner bases algorithm tailored for the cryptanalysis of multivariate post-quantum public-key cryptosystems. He is a regular contributor to the SageMath, a Python-based open-source computer algebra system. He has been improving the module for analyzing cryptographic properties of Boolean functions and S-Boxes.

Work Experiences

Education

Publications

    Journals

  1. Emanuele Bellini, Juan Grados, Rusydi H. Makarim, Carlo Sanna. Finding differential trails on ChaCha by means of state functions . International Journal of Applied Cryptography, Volume 4, Numbers 3/4, 2024. pp 156-175.
  2. Stefano Barbero, Emanuele Bellini, Rusydi H. Makarim. Rotational analysis of ChaCha permutation. Advances in Mathematics of Communications, Volume 17, Number 6, 2023. pp 1422-1439. ePrint
  3. Emanuele Bellini, David Gérault, Juan Grados, Rusydi H. Makarim, Thomas Peyrin. Boosting Differential-Linear Cryptanalysis of ChaCha7 with MILP. IACR Transactions on Symmetric Cryptology, Volume 2023, Number 2, 2023. pp 189-223.
  4. Rusydi H. Makarim, Raghvendra Rohit. Towards Tight Differential Bounds of Ascon: A Hybrid Usage of SMT and MILP. IACR Transactions on Symmetric Cryptology, Volume 2022, Number 3, 2022. pp 303-340.
  5. Carlos Aguilar Melchor, Nicolas Aragon, Emanuele Bellini, Florian Caullery, Rusydi H. Makarim, Chiara Marcolla. Constant Time Algorithms for ROLLO-I-128. SN Computer Science, Volume 2, Number 5, 2021. ePrint
  6. Putranto H. Utomo, Rusydi H. Makarim. Solving a Binary Puzzle Mathematics in Computer Science, Volume 11, Numbers 3-4, 2017. pp 515-526.

    7. Conferences

  7. Solane El Hirch, Joan Daemen, Raghvendra Rohit, Rusydi H. Makarim. Twin Column Parity Mixers and Gaston - A New Mixing Layer and Permutation. 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part III. pp 475-506. ePrint
  8. Emanuele Bellini, David Gérault, Juan Grados, Yun Ju Huang, Rusydi H. Makarim, Mohamed Rachidi, Sharwan K. Tiwari. CLAASP: A Cryptographic Library for the Automated Analysis of Symmetric Primitives. Selected Areas in Cryptography - SAC 2023 - 30th International Conference, Fredericton, Canada, August 14-18, 2023, Revised Selected Papers. pp 387-408. ePrint
  9. Emanuele Bellini, David Gérault, Juan Grados, Rusydi H. Makarim, Thomas Peyrin. Fully Automated Differential-Linear Attacks Against ARX Ciphers. Topics in Cryptology - CT-RSA 2023 - Cryptographers' Track at the RSA Conference 2023, San Francisco, CA, USA, April 24-27, 2023, Proceedings. pp 252-276. ePrint
  10. Emanuele Bellini, Rusydi H. Makarim, Carlo Sanna, Javier A. Verbel. An Estimator for the Hardness of the MQ Problem. 13th International Conference on Cryptology in Africa, AFRICACRYPT 2022, Fes, Morocco, July 18-20, 2022, Proceedings. pp 323-347. ePrint
  11. Emanuele Bellini, Alessandro De Piccoli, Rusydi H. Makarim, Sergio Polese, Lorenzo Riva, Andrea Visconti. New Records of Pre-image Search of Reduced SHA-1 Using SAT Solvers. Proceedings of the Seventh International Conference on Mathematics and Computing - ICMC 2021, Shibpur, India. pp 141-151.
  12. Emanuele Bellini, Florian Caullery, Rusydi H. Makarim, Marc Manzano, Chiara Marcolla, Víctor Mateu. Advances and Challenges of Rank Metric Cryptography Implementations. 37th IEEE International Conference on Computer Design, ICCD 2019, Abu Dhabi, United Arab Emirates, November 17-20, 2019. pp 325-328.
  13. Rusydi H. Makarim, Marc Stevens. M4GB: An Efficient Gröbner-Basis Algorithm. Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017. pp 293-300. ePrint
  14. Rusydi H. Makarim, Cihangir Tezcan. Relating Undisturbed Bits to Other Properties of Substitution Boxes . Lightweight Cryptography for Security and Privacy - 3rd International Workshop, LightSec 2014, Istanbul, Turkey, September 1-2, 2014, Revised Selected Papers. pp 109-125. ePrint
  15. Imad Fakhri Al Shaikhli, Akram M. Zeki, Rusydi H. Makarim, Al-Sakib Khan Pathan. Protection of Integrity and Ownership of PDF Documents Using Invisible Signature . 14th International Conference on Computer Modelling and Simulation (UKSim) 2012, Cambridge, United Kingdom. pp 533-537.

    16. Preprints

  16. Emanuele Bellini, Rusydi H. Makarim. Functional Cryptanalysis: Application to reduced-round Xoodoo. IACR Cryptology ePrint Archive, Volume 2022, No. 134.

Open-Source Softwares

  • SageMath

    SageMath is a free open-source Python-based computer algebra system licensed under the GPL. It offers modules to evaluate the cryptographic properties of Boolean functions and S-Boxes. The current state of the implementation covers fundamental evaluation criteria related to nonlinearity, differential properties, algebraic aspects, branch numbers, bentness, etc.

  • M4GB

    M4GB is an efficient Groebner basis algorithm designed specifically to maintain tail-reduced polynomials. This C++11 implementation is optimized for dense overdefined system of polynomial equations that represent multivariate public key and digital signature schemes. M4GB and its implementation successfully broke several concrete parameters for multivariate digital signature algorithm, a potential candidate for post-quantum digital signature scheme. The result is available at https://www.mqchallenge.org.

  • Multivariate Quadratic (MQ) Estimator

    MQ Estimator is a SageMath package providing functions and classes to estimate the complexity of instances of MQ problem. The MQ problem is the hard problem underlying the construction of multiple post-quantum digital signature schemes in the NIST competition.