A knapsack public-key cryptosystem based on elliptic curve discrete logarithm

作者:

Highlights:

摘要

There is no question that knapsack systems still warrant continuous researches, as a result of the NP-completeness nature, the faster speed, and a desire to have a wide variety of available cryptosystems. This paper presents a new knapsack-type public key cryptosystem based on a novel application of the elliptic curve logarithm problem. The difficulty can be made sufficient to frustrate attacks against the survey major knapsack public-key cryptosystems developed in the past more than 20 years, and hope-fully shed some light on the future of the knapsack cryptosystems. The proposed new cryptosystem can be found some theoretic support on confidentiality.

论文关键词:Knapsack system,NP-completeness,Public key cryptosystem,Elliptic curve

论文评审过程:Available online 5 November 2004.

论文官网地址:https://doi.org/10.1016/j.amc.2004.08.027