Trapdoor Knapsacks Without Superincreasing Structure
暂无分享，去创建一个
Abstract Shamir (1982) has recently presented a polynomial-time algorithm for breaking Merkle-Hellman public-key schemes. The flaw in such a scheme is not in the use of knapsacks per se, but in the embedding of superincreasing structure as a trapdoor technique. In this paper, several trapdoor techniques are outlined that are not dependent on hiding superincreasing sequences.
[1] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[2] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[3] Adi Shamir,et al. On the cryptocomplexity of knapsack systems , 1979, STOC.
[4] Martin E. Hellman,et al. Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.