applied cryptography - protocols, algorithms, and source code in c

110 137 m benor o goldreich s goldwasser j hstad j

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: oxes for Ciphers Resistant to Differential Cryptanalysis,” Proceedings of the 3rd Symposium on State and Progress of Research in Cryptography, Rome, Italy, 15–16 Feb 1993, pp. 181–190. 11. W. Adams and D. Shanks, “Strong Primality Tests That Are Not Sufficient,” Mathematics of Computation, v. 39, 1982, pp. 255–300. 12. W.W. Adams and L.J. Goldstein, Introduction to Number Theory, Englewood Cliffs, N.J.: Prentice–Hall, 1976. 13. B.S. Adiga and P. Shankar, “Modified Lu–Lee Cryptosystem,” Electronics Letters, v. 21, n. 18, 29 Aug 1985, pp. 794–795. 14. L.M. Adleman, “A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography,” Proceedings of the IEEE 20th Annual Symposium of Foundations of Computer Science, 1979, pp. 55–60. 15. L.M. Adleman, “On Breaking Generalized Knapsack Public Key Cryptosystems,” Proceedings of the 15th ACM Symposium on Theory of Computing, 1983, pp. 402– 412. 16. L.M. Adleman, “Factoring Numbers Using Singular Integers,” Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing, 1991, pp. 64–71. 17. L.M. Adleman, “Molecular Computation of Solutions to Combinatorial Problems,” Science, v. 266, n. 11, Nov 1994, p. 1021. 18. L.M. Adleman, D. Estes, and K. McCurley, “Solving Bivariate Quadratic Congruences in Random Polynomial Time,” Mathematics of Computation, v. 48, n. 177, Jan 1987, pp. 17–28. 19. L.M. Adleman, C. Pomerance, and R.S. Rumeley, “On Distinguishing Prime Numbers from Composite Numbers,” Annals of Mathematics, v. 117, n. 1, 1983, pp. 173–206. 20. L.M. Adleman and R.L. Rivest, “How to Break the Lu–Lee (COMSAT) Public–Key Cryptosystem,” MIT Laboratory for Computer Science, Jul 1979. 21. G.B. Agnew, “Random Sources for Cryptographic Systems,” Advances in Cryptology—EUROCRYPT ’87 Proceedings, Springer–Verlag, 1988, pp. 77–81. 22. G.B. Agnew, R.C. Mullin, I.M. Onyszchuk, and S.A. Vanstone, “An Implementation for a Fast Public–Key Cryptosystem,” Journal of Cryptology, v. 3, n. 2, 1991, pp....
View Full Document

Ask a homework question - tutors are online