Discrete logarithms in finite fields and their cryptographic significance
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
The State of Elliptic Curve Cryptography
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Non-injective knapsack public-key cryptosystems
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Short Signatures from the Weil Pairing
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A communication-efficient and fault-tolerant conference-key agreement protocol with forward secrecy
Journal of Systems and Software
A knapsack-based probabilistic encryption scheme
Information Sciences: an International Journal
New directions in cryptography
IEEE Transactions on Information Theory
An improved algorithm for computing logarithms over and its cryptographic significance (Corresp.)
IEEE Transactions on Information Theory
Hiding information and signatures in trapdoor knapsacks
IEEE Transactions on Information Theory
A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
IEEE Transactions on Information Theory
Reducing elliptic curve logarithms to logarithms in a finite field
IEEE Transactions on Information Theory
Linearly shift knapsack public-key cryptosystem
IEEE Journal on Selected Areas in Communications
Enhanced short signature scheme with hybrid problems
Computers and Electrical Engineering
| Hi-index | 0.00 |
Though a lot of public key cryptographic algorithms have been proposed, practically some cryptographic systems' security will no longer be secure unless the corresponding hard problems are solved in the future. Enhancing security is the major objective for public key cryptosystems on the basis of the hardness of the intractable computational problems. In this paper, we present a new cryptosystem design based on linearly shift knapsack and elliptic curve discrete logarithm problems. Having concatenated Knapsack and ECC hard problems, the presented scheme has solid structure and will hopelessly leave the eavesdropper baffled. The performance analysis has been given to describe the proposed scheme in terms of security level. In addition, the security performance in encryption/decryption complexity is equivalent to related cryptosystems with the nature of security. At the moment, no malicious attacks are capable of ''breaking'' this scheme in a reasonable amount of time obviously.