论文信息 - Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems

Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems

Abstract In this paper we show that after sufficiently many modular multiplications, any knapsack system becomes a trapdoor system that can be used in public-key cryptography.

Adi Shamir

[1] Jeffrey C. Lagarias. The computational complexity of simultaneous Diophantine approximation problems , 1982, FOCS 1982.

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

[3] A. Shamir. A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem , 1982, FOCS 1982.

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