Publication: The Fuzzy Scheduling Algorithm for the Parallel Key Searching Problem on Cloud Environment
Issued Date
2018-08-21
Resource Type
Other identifier(s)
2-s2.0-85053458211
Rights
Mahidol University
Rights Holder(s)
SCOPUS
Bibliographic Citation
ICSEC 2017 - 21st International Computer Science and Engineering Conference 2017, Proceeding. (2018), 10-14
Suggested Citation
Pimsiri Tubthong, Vasin Suttichaya The Fuzzy Scheduling Algorithm for the Parallel Key Searching Problem on Cloud Environment. ICSEC 2017 - 21st International Computer Science and Engineering Conference 2017, Proceeding. (2018), 10-14. doi:10.1109/ICSEC.2017.8443824 Retrieved from: https://repository.li.mahidol.ac.th/handle/20.500.14594/45594
Research Projects
Organizational Units
Authors
Journal Issue
Thesis
Title
The Fuzzy Scheduling Algorithm for the Parallel Key Searching Problem on Cloud Environment
Author(s)
Other Contributor(s)
Abstract
© 2017 IEEE. Rainbow table is the well-known cryptanalytic method for searching the encryption key or the plaintext. The user can precompute several lookup tables in order to increase the success probability. These tables can be distributed to multiprocessor or parallel machines for decreasing the makespan. Searching problem using the Rainbow table differs from the others traditional problem. The problem can only be solved on some node. However, if the problem can't be solved on current node, it must be re-executed on the other node. Thus, using FCFS algorithm is not the proper solution. We proposed the fuzzy scheduling for the parallel key searching problem, using Rainbow table. The algorithm is implemented and evaluated by Cloudsim. The result shows the proposed method reduces the makespan from the traditional FCFS.