Computer Security and Cryptography

REFERENCES

LEN ADELMAN, “On Breaking Generalized Knapsack Public Key Cryptosystems,” Proceedings of the 15th ACM Symposium on The Theory of Computing, New York, NY, 1983, pp. 402–412.

B. S. ADIGA AND P. SHANKAR, “Modified Lu-Lee Cryptosystem,” Electronic Letters, 21, 794−795 (1985).

E. BRICKELL, “Are Most Low Density Knapsacks Solvable in Polynomial Time?,” Proceedings of the 14th Southeastern Conference on Combinatorics, Graph Theory and Computing, 1983.

J. W. S. CASSELS, An Introduction to Diophantine Approximation, Cambridge Tracts in Mathematics, Number 45, 1957.

B. CHOR AND R. L. RIVEST “A Knapsack-Type Public Key Cryptosystem Based on Arithmetic in Finite Fields,” IEEE Transactions on Information Theory, 34, pp. 901–990 (1988).

J. M. GOETHALS AND C. COUVRER, “A New Trapdoor Knapsack Public Key Cryptosystem,” Philips Journal of Research, 35, 301–306 (1980).

R. M. GOODMAN AND A. J. MCAULEY. “A New Trapdoor Knapsack Public Key Cryptosystem,” Proceedings of Eurocrypt 84 Springer Verlag, New York, 1984.

J. C. LAGARIAS, “The Computational Complexity of Simultaneous, Diophantine Approximation Problems,” SIAM Journal of Computing, 14, 1985, pp. 196–209; [Preliminary version in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, IEEE Press, New York, November 1982, pp. 32–39.]

J. C. LAGARIAS, “Knapsack Public Key Cryptosystems and Diophantine Approximation,” Advances in Cryptography, Plenum Publishing Company (New York), 1984.

J. C. LAGARIAS AND A. M. ODLYZKO ...