معرفی
Suthee Ruangwises is a Lecturer at the Department of Computer Engineering, Chulalongkorn University. He holds a PhD and Master's from Tokyo Institute of Technology (2020 and 2017) under Prof. Toshiya Itoh and Prof. Osamu Watanabe, and a Bachelor's from MIT (2015). His research focuses on card-based cryptography, puzzle complexity analysis, and matching under preferences, with notable work on physical zero-knowledge proofs and NP-completeness proofs for puzzles.
- Postdoctoral positions at Tokyo Institute of Technology (2020–2024) and University of Electro-Communications (UEC).
- Recipient of the Best Paper Award at APKC 2025 for work on Sumplete puzzles.
- Active in international conferences such as UCNC, CiE, and WALCOM.
Research interests span secure multiparty computation, graph algorithms, and cryptographic protocol design. He maintains databases of card-based cryptography papers and NP-completeness proofs for pencil puzzles. His Erdős number is 3 via collaboration with Toshiya Itoh.
Teaching includes Computational Theory at Chula. Recent publications emphasize innovations in physical cryptographic protocols and puzzle-based computational problems, reflecting his interdisciplinary approach at the intersection of cryptography, algorithms, and combinatorics.
