Integer programming and cryptography
暂无分享,去创建一个
[1] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[2] G. J. Simmons,et al. Cryptology: The Mathematics of Secure Communication , 1979 .
[3] L. Lovász. A new linear programming algorithm — better or worse than the Simplex Method? , 1980 .
[4] Hendrik W. Lenstra,et al. Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..
[5] Adi Shamir,et al. A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem , 1984, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[6] Martin E. Hellman,et al. Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .