Fast decryption algorithm for the knapsack cipher

Abstract A fast decryption algorithm is described which permits use of the knapsack cipher (a public-key cryptosystem) at data rates in the neighborhood of 10 Mbit/sec. This high-speed capability can be used to incorporate the security and flexibility of public-key cryptosystems into a wide variety of real-time communications applications. Implementation of the algorithm using Very Large Scale Integration appears attractive: The circuit functions required are approximately 56 kilobits of memory and a small amount of arithmetic logic.

[1]  Martin E. Hellman,et al.  Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.

[2]  Gustavus J. Simmons,et al.  Symmetric and Asymmetric Encryption , 1979, CSUR.

[3]  T. Wada,et al.  A 256 K dynamic RAM , 1980, 1980 IEEE International Solid-State Circuits Conference. Digest of Technical Papers.

[4]  Adi Shamir,et al.  On the security of the Merkle- Hellman cryptographic scheme (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[5]  P.M. Russo.  VLSI Impact on microprocessor evolution, usage, and system design , 1980, IEEE Transactions on Electron Devices.

[6]  M.E. Hellman,et al.  Privacy and authentication: An introduction to cryptography , 1979, Proceedings of the IEEE.