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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
