سال انتشار: ۱۳۸۹
محل انتشار: هفتمین کنفرانس انجمن رمز ایران
تعداد صفحات: ۷
roohallah rastaghi – department of electrical engineering shahid sattari air university tehran
mahmood gardeshi – fath research center imam hossain university
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.