1. The computational complexity of simultaneous diophantine approximation problems;Lagarias;Proc. 23rd Conf. on Foundations of Computer Science,1982
2. Hiding information and signatures in trapdoor knapsacks;Merkle;IEEE Trans. Inform. Theory,1978
3. On the security of the Merkle-Hellman cryptographic scheme;Shamir;IEEE Trans. Inform. Theory,1980
4. A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem;Shamir;Proc. 23rd Conf. on Foundations of Computer Science,1982