On the expressiveness of subset-sum representations
暂无分享,去创建一个
[1] Adi Shamir. A Fast Signature Scheme , 1978 .
[2] Martin E. Hellman,et al. Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.
[3] Arto Salomaa. A Deterministic Algorithm for Modular Knapsack Problems , 1991, Theor. Comput. Sci..
[4] Gerald Berman,et al. Introduction to Combinatorics , 1972 .
[5] Ioan Tomescu. Problems in combinatorics and graph theory , 1985 .
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] Arto Salomaa,et al. Public-Key Cryptography , 1996, Texts in Theoretical Computer Science. An EATCS Series.
[8] Leonard M. Adleman,et al. On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem , 1982, CRYPTO.
[9] Arto Salomaa. Decision problems arising from knapsack transformations , 1990, Acta Cybern..
[10] I. Anderson. Combinatorics of Finite Sets , 1987 .
[11] A. Shamir. A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem , 1982, FOCS 1982.
[12] Adi Shamir. Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems , 1983, Inf. Process. Lett..