Abstract: The Merkle-Hellman invented in 1978 is based on the superincreasing subset problem. Ralph Merkle and Martin Hellman used the subset problem to create a cryptosystem to encrypt data. A super-increasing knapsack vector s is created and the super-increasing property is hidden by creating a second vector M by modular multiplication and permutation. The vector M is the public key of the cryptosystem and s is used to decrypt the message. This paper demonstrates how to strengthen the encrypted message being sent by use of discrete logarithmics so that only the intended recipient of the message is able to decipher the message.