As a diversion we return in this chapter to another (once) promising public-key encryption scheme using a trap-door function: Knapsack encryption. It, too, is based on residue arithmetic, but uses multiplication rather than exponentiation, making it easier to instrument and theoretically more transparent.
Unable to display preview. Download preview PDF.
- 14.11 N. J. A. Sloane: “Error-Correcting Codes and Cryptography,” in The Mathematical Gardener, ed. by D. Klarner (Prindle Weber Schmidt, Boston 1981) pp. 347–382. Republished in Cryptologia 6, 128–153, 258–278 (1982)Google Scholar
- 14.2R. C. Merkle, M. E. Hellman: Hiding information and signatures in trapdoor knapsacks. IEEE Trans. IT-24, 525–530 (1978)Google Scholar
- 14.A. Shamir: “A Polyominal Time Algorithm for Breaking Merkle-Hellman Cryptosystems,” Internal Report Applied Mathematics, The Weizmann Institute, Rehovot, IsraelGoogle Scholar
- 14.4Y. Desmedt, J. Vandewalle, R. Govaerts: “Critical Analysis of the Security of Knapsack Public Key Algorithms,” in Proceedings of the IEEE International Symposium on Information Theory ( IEEE, New York 1982 ) pp. 115–116Google Scholar
- 14.J. C. Lagarias (personal communication)Google Scholar