A new trapdoor knapsack public-key cryptosystem

Authors:
R F Goodman;A J McAuley
Affiliations:
-;-
Venue:
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Year:
1985

Citing 1
Cited 2

A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM

Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions

Computational Complexity
Chemical reaction optimization with greedy strategy for the 0-1 knapsack problem

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new trapdoor-knapsack public-key-cryptosystem. The encryption equation is based on the general modular knapsack equation, but unlike the Merkle-Hellman scheme the knapsack components do not have to have a superincreasing structure. The trapdoor is based on transformations between the modular and radix form of the knapsack components, via the Chinese Remainder Theorem. The resulting cryptosystem has high density and has a typical message block size of 2000 bits and a public key of 14K bits. The security is based on factoring a number composed of 256 bit prime factors. The major advantage of the scheme when compared with the RSA scheme is one of speed. Typically, knapsack schemes cuch as the one proposed here are capable of throughput speeds which are orders of magnitude faster than the RSA scheme.