a new public key cryptosystem

In this paper a new knapsack-type public key cryptosystem in introduced. This cryptosystem is based on multiplicative knapsack subset product problem which in a NP-complete problem. The ciphertext is obtained by multiplying the public -keys indexed by the message bits and the plaintext is recovered by factoring the ciphertext raised to a secret power. we show that the security of proposed cryptosystem is based on discrete logarithm problem.

Keywords:

public key cryptosystem , multiplicative knapsack problem , subset product problem , discrete logarithm problem