Article ID Journal Published Year Pages File Type
9506664 Applied Mathematics and Computation 2005 7 Pages PDF
Abstract
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.
Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Authors
, , ,