{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

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

1185 l oconnor enumerating nondegenerate permutations

Info icon This 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: entication Procedures,” RFC 1421, Feb 1993. 982. S. Lloyd, “Counting Binary Functions with Certain Cryptographic Properties,” Journal of Cryptology, v. 5, n. 2, 1992, pp. 107–131. 983. T.M.A. Lomas, “Collision–Freedom, Considered Harmful, or How to Boot a Computer,” Proceedings of the 1995 Korea–Japan Workshop on Information Security and Cryptography, Inuyama, Japan, 24–26 Jan 1995, pp. 35–42. 984. T.M.A. Lomas and M. Roe, “Forging a Clipper Message,” Communications of the ACM, v. 37, n. 12, 1994, p. 12. 985. D.L. Long, “The Security of Bits in the Discrete Logarithm,” Ph.D. dissertation, Princeton University, Jan 1984. 986. D.L. Long and A. Wigderson, “How Discrete Is the Discrete Log,” Proceedings of the 15th Annual ACM Syposium on the Theory of Computing, Apr 1983. 987. D. Longley and S. Rigby, “An Automatic Search for Security Flaws in Key Management Schemes,” Computers and Security, v. 11, n. 1, Jan 1992. pp. 75–89. 988. S.H. Low, N.F. Maxemchuk, and S. Paul, “Anonymous Credit Cards,” Proceedings of the 2nd Annual ACM Conference on Computer and Communications Security, ACM Press, 1994, pp. 108–117. 989. J.H. Loxton, D.S.P. Khoo, G.J. Bird, and J. Seberry, “A Cubic RSA Code Equivalent to Factorization,” Journal of Cryptology, v. 5, n. 2, 1992, pp. 139–150. 990. S.C. Lu and L.N. Lee, “A Simple and Effective Public–Key Cryptosystem,” COMSAT Technical Review, 1979, pp. 15–24. 991. M. Luby, S. Micali, and C. Rackoff, “How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically–Biased Coin,” Proceedings of the 24nd Annual Symposium on the Foundations of Computer Science, 1983, pp. 11–22. 992. M. Luby and C. Rackoff, “How to Construct Pseudo–Random Permutations from Pseudorandom Functions,” SIAM Journal on Computing, Apr 1988, pp. 373–386. 993. F. Luccio and S. Mazzone, “A Cryptosystem for Multiple Communications,” Information Processing Letters, v. 10, 1980, pp. 180–183. 994. V...
View Full Document

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern