Publisher : The Korean Institute of Information and Commucation Engineering
DOI : 10.6109/jkiice.2015.19.12.2865
Title & Authors
An enhanced method using NP-complete problem in Public Key Cryptography System Baek, Jaejong;
Recently, due to the hardware computing enhancement such as quantum computers, the amount of information that can be processed in a short period of time is growing exponentially. The cryptography system proposed by Koblitz and Fellows has a problem that it can not be guaranteed that the problem finding perfect dominating set is NP-complete in specific 3-regular graphs because the number of invariant polynomial can not be generated enough. In this paper, we propose an enhanced method to improve the vulnerability in 3-regular graph by generating plenty of invariant polynomials.