A New Trapdoor Knapsack Public Key Cryptosystem
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 such as the one proposed here are capable of throughput speeds which are orders of magnitude faster than the RSA scheme.
Keywordscryptography ciphers codes knapsack problem public key
- 4.Y. Desmet, J. Vandewalle, and R. Govaerts, “A critical analysis of the security of knapsack public key cryptosystems”, IEEE Symp. on Information Theory, Les Arcs, France, June 1982.Google Scholar
- 5.E.F. Brickell, “Solving low density knapsacks”, Sandia National Laboratories, Albuquerque, New Mexico, USA, 13p, 1983.Google Scholar
- 6.J.C. Lagarias, and A.M. Odlyzko, “Solving low-density subset sum problems”, Bell Laboratories, Murray Hill, New Jersey, USA, 38p, 1983.Google Scholar
- 7.D.E. Knuth, The Art of Computer Programming, Vol. 1., “Fundamental Algorithms”, Addison-Wesley, 1968.Google Scholar
- 8.S.C. Lu, and L.N. Lee, “A simple and effective public key cryptosystem”, Comsat Tech. Rev., Vol. 9., pp15–24, Spring 1979.Google Scholar