SUPPAKITPAISARN Vorapong


スッパキットパイサーン ウォラポン （SUPPAKITPAISARN Vorapong）
SUPPAKITPAISARN Vorapong

SUPPAKITPAISARN Vorapong
Title Project Associate Professor
Affiliation Department of Computer Science (CS), Graduate School of Information Science and TechnologyDepartment of Information Science (IS), Faculty of Science, Department of Information Science (UG), Graduate School of Information Science and Technology
E-mail


Research Field

Graph Algorithms, Cryptography

Research Subject

Optimization Techniques for Sensor Networks, Software-Defined Networks, Information-Centric Networking, and Robust Networks. Algorithms for Elliptic Curve Cryptography, Discrete Logarithms, and Database Privacy.

Current Research

Researches in Discrete Mathematics can be applied to solve several applied problems in computer science. Since we can model the Internet architecture using graphs, we can use results from Graph Theory and algorithms to maximize the efficiency, increase the robustness, and reduce latency of networks. Similarly, we can use results from Number Theory to reducing computation times of cryptographic system, we can also use them to devise algorithms for breaking the system and analyze how strong each system is.

Keywords

Robust Network Optimization, Network Algorithm, Discrete Mathematics, Cryptography, Markov Chain

Links