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

Pin Chang Su, Erl Huei Lu*, Henry Ker Chang Chang

*Corresponding author for this work

Research output: Contribution to journalJournal Article peer-review

9 Scopus citations

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.

Original languageEnglish
Pages (from-to)40-46
Number of pages7
JournalApplied Mathematics and Computation
Volume168
Issue number1
DOIs
StatePublished - 01 09 2005

Keywords

  • Elliptic curve
  • Knapsack system
  • NP-completeness
  • Public key cryptosystem

Fingerprint

Dive into the research topics of 'A knapsack public-key cryptosystem based on elliptic curve discrete logarithm'. Together they form a unique fingerprint.

Cite this