Improvement of Merkle-Hellman Scheme using RSA Problem
Keywords:
Knapsack problem, super increasing vector, subset sum problem
Abstract
The public key cryptosystem proposed by Merkle and Hellman in 1978 is based on “Knapsack Problem”. In this paper, we demonstrate a polynomial message which have been encrypted through the Merkle-Hellman encryption scheme by using RSA problem. This scheme is more efficient because only proposed receiver is decode the message.
References
M.Hellman and R.Merkle, Hiding information and signatures in trapdoor knapsacks, IEEE Trans. Inform. Theory, 24(1978), 525-530.
A.Menezes, P.Vanoorschot and S.Vanstone, Handbook of Applied Cryptography, CRC Press, (1996).
W.Diffie and M.Hellman, New directions in cryptography, IEEE Trans. Inform. Theory, 22(1976), 644-654.
Ashish Agarwal, Encrypting Message using the Merkle Hellman Knapsack Cryptosystem, International Journal of Computer Science and Network Security, 11(2011), 12-14.
Richard M.Karp, Reducibility among combinatorial problems in Complexity of Computer Computations, Raymond E. Miller and James W. Thatcher (eds.) Plenum Press, NY, (1972).
A.Menezes, P.Vanoorschot and S.Vanstone, Handbook of Applied Cryptography, CRC Press, (1996).
W.Diffie and M.Hellman, New directions in cryptography, IEEE Trans. Inform. Theory, 22(1976), 644-654.
Ashish Agarwal, Encrypting Message using the Merkle Hellman Knapsack Cryptosystem, International Journal of Computer Science and Network Security, 11(2011), 12-14.
Richard M.Karp, Reducibility among combinatorial problems in Complexity of Computer Computations, Raymond E. Miller and James W. Thatcher (eds.) Plenum Press, NY, (1972).
How to Cite
Swati Verma. (2016). Improvement of Merkle-Hellman Scheme using RSA Problem. International Journal of Current Research in Science and Technology, 2(1), 51-54. Retrieved from https://crst.gfer.org/index.php/crst/article/view/59
Issue
Section
Articles