Graph Algorithms, Cryptography
Optimization Techniques for Sensor Networks, Software-Defined Networks, Information-Centric Networking, and Robust Networks. Algorithms for Elliptic Curve Cryptography, Discrete Logarithms, and Database Privacy.
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.
Robust Network Optimization, Network Algorithm, Discrete Mathematics, Cryptography, Markov Chain