New trapdoor-knapsack public-key cryptosystem
- 1 January 1985
- journal article
- Published by Institution of Engineering and Technology (IET) in IEE Proceedings E Computers and Digital Techniques
- Vol. 132 (6) , 289-292
- https://doi.org/10.1049/ip-e.1985.0040
Abstract
The 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 security is based on factoring a number composed of 256 bit prime factors. The resulting cryptosystem has high density, approximately 30% message expansion and a public key of 14 Kbits. This compares very favourably with the Merkle-Hellman scheme which has over 100% expansion and a public key of 80 Kbits. The major advantage of the scheme when compared with the RSA scheme is one of speed. Typically, knapsack schemes such as the one proposed here are capable of throughput speeds which are orders of magnitude faster than the RSA scheme.Keywords
This publication has 2 references indexed in Scilit:
- Solving Low Density KnapsacksPublished by Springer Nature ,1984
- Solving low density subset sum problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983