Abstract

Cryptography is the essential component in any protocols for securing the communication. Diffie and Hellman introduced the concept of Public key cryptosystem, which uses two different keys for secure communication. Ralph Merkle and Martin Hellman invented a public-key cryptosystem named as Merkle-Hellman Knapsack Cryptosystem (MHKC) which is an NP-complete combinatorial problem believed that computationally difficult to solve by intruders. All the public key elements are the modulus of multiples of super increasing sequence. Adi Shamir performs cryptanalysis and breaks the MHKC in polynomial time. In this paper, a novel public key cryptosystem based on MHKC (NPKC-MHKC) has been proposed, which is secure than MHKC. NPKC-MHKC consists of Public key, Private key, and Session key. Since all the three keys depend on each other, it is computationally infeasible for the intruder to break the cryptosystem. The performance analysis shows that the execution time of NPKC-MHKC is comparatively lesser than MHKC and security analysis proves that NPKC-MHKC is secure than MHKC. So, NPKC-MHKC can be implemented in High-performance computing applications.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.