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

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...

Full description

Saved in:
Bibliographic Details
Published inApplied mathematics and computation Vol. 168; no. 1; pp. 40 - 46
Main Authors Su, Pin-Chang, Lu, Erl-Huei, Chang, Henry Ker-Chang
Format Journal Article
LanguageEnglish
Published New York, NY Elsevier Inc 01.09.2005
Elsevier
Subjects
Algebra
Applied sciences
Cryptography
Elliptic curve
Exact sciences and technology
Information, signal and communications theory
Knapsack system
Mathematics
NP-completeness
Number theory
Public key cryptosystem
Sciences and techniques of general use
Signal and communications theory
Telecommunications and information theory
Public key cryptosystem
Elliptic curve
Knapsack system
NP-completeness
Confidentiality
Applied mathematics
Public key
Completeness
NP complete problem
Knapsack problem
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2004.08.027