[244] Kranakis, Е., Primality and Cryptography, Wiley-Teubner Series in Computer Science, 1986.

[245] Lagarias, J. C, Odlyzko, A. M",Solving low-density siiliset sum problems". Journal of the ACM, vol. 32, 1985, pp. 229-246.

[246] Lakshmivarahan, S., "Algorithms for pubUc-key cryptosystems: Theory and apphcation". Advances in Computers, vol. 22, 1983, pp. 45-108.

[247] LaMacchia. B. a., Odlyzko, a. M., "Computation of discrete logarithms in prime fields" Designs, Codes and Cryptography, vol. 1, 1991, pp. 47-62.

[248] Landau, S., "Zero knowledge and the department of defense". Notices of the American Mathematical Society, vol. 35, 1988, pp. 5-12.

[249] Lempel, a., "Cryptology in transition", ACM Computing Surveys, vol. 11, 1979, pp. 285-303.

[250] Levin, L. a., "One-way functions and pseudo-random generators". Proceedings of llth ACM Symposium on Theory of Computing, May 1985, pp. 363-365.

[251] LiPTON, R., "How to cheat at menteJ poker". Proceedings of American Mathematical Society Short Course on Cryptography, 1981.

[252] LoNGPRE, L., "The use of pubhc-key cryptography for signing checks". Advances in Cryptology: Proceedings of Crypto 82, August 1982, Plenum Press, pp. 187-197.

[253] Luby, M., Micali, S., Rackoff, C, "How to simultaneously exchange a secret bit by fUpping a symmetrically-biased coin". Proceedings of 24th IEEE Symposium on Foundations of Computer Science, November 1983, pp. 11-21.

[254] Luby, M., Rackoff, C, "How to construct pseudorandom permutations from pseudorandom functions", SIAM Journal on Computing, vol. 17, 1988, pp. 373-386.

[255] Lund, C, Fortnow, L., Karloff, H., Nisan, N., "Algebraic methods for interactive proof systems". Proceedings of 31st IEEE Symposium on Foundations of Computer Science, October 1990, pp. 2-10.

[256] MacMillan, Dj, "Single chip encrypts data at Is", Electron-

ics, 16 June 1981, pp. 161-165.

[257] Massey, J. L., t"Contemporeiry cryptology: An introduction", в: [333], 1992, pp. 1-39; (есть русский перевод журнальной версии в: ТИИЭР, т. 76 (май 1988), № 5, стр. 24-42).

[258] Matyas, S., "Digital signatures - an overview", Computer Networks, vol. 3, 1979, pp. 87 - 94.

[259] Maurer, U.M., "Conditionally-perfect secrecy and a pibvably-secure randomized cipher". Journal of Cryptology, vol. 5, 1992, pp. 53-66.

[260] Maurer, U. M., "Fast generation of prime numbers and secure pubhc-key cryptographic parameters", будет опубликовано в Journal of Cryptology, предварительнал версия в: Advances in Cryptology - Eurocrypt 89 Proceedings, April 1989, Springer - Verlag, pp. 636-647.

[261] Maurer, U. M., "Secret key agreement by pubhc discussion based on common information", будет опубликовано в IEEE Transactions on Information Theory, предварительная версия в: Proceedings of 23rd ACM Symposium on Theory of Computing, May 1991, pp. 561-571.

[262] McEliece, R. j., "a pubhc-key cryptosystem based on cilgebraic coding theory", DSN Progress Report 42-44, Jet Propulsion Laboratory, 1978, pp. 114-116.

[263] Menezes, a. j., Oorschot, van, P. C, Vanstone, S. a., Hand-"bookof Applied Cryptoldgy,CkC Press, N. W., Boca Raton, Florida, 1996.

[264] McIvOR, R., "Smart cards". Scientific American, November 1985, pp. 130-137.

[265] Merkle, R. C, "Secure communications over insecure chamnels". Communications of the ACM, vol. 21, 1978, pp. 294-299.

[266] Merkle, R. C, Hellman, M.E., "Hiding information and signa-tiu-es in trapdoor knapsacks", IEEE Transactions on Information Theory, vol. IT-24, 1978, pp. 525-530.

[267] Merkle, R. C, Hellman, M. E., "On the secmity of multiple encryption". Communications of the ACM, vol. 24, 1981, pp. 465-467.

[268] Meyer, C. H., Matyas, S. M., Cryptography: A New Dimension in Computer Data Security, John Wiley & Sons, New York, NY, 1982.

[269] Micali, S., Schnorr, C. P., "Efficient, perfect polynomial random nuinber generators". Journal of Cryptology, vol. 3, 1991, pp. 157-172.

[270] Montgomery, Pj. L., "Modular multiphcation without trial uvi-тх", Mathematics of Computation, voL 441985, pp. 519-521.

[271] morain, F., "Atkins test: News from the front", Advances in Cryptology - Eurocrypt89 Proceedings, April 1989, Springer - Veriag, , , pp. 626-635. . : ,

[272] Morris, R., Thompson, K., "Password seciuity: A case history". Communications of the ACM, vol. 22, 1979, pp. 594-597.

[273] Naor, M., "Bit commitment using pseudo-randomness". Journal of Cryptology, vol. 4, 1991, pp. 151-158.

[274] Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M., "Perfect zero-knowledge arguments for MV can be bcised on genercil complexity cissumptions", Advances in Cryptology - Crypto 92 Proceedings, August 1992, Springer - Verlag.

[275] Naor, M., Yung, M., "Universal one-way hash functions and their cryptographic apphcations", Proceedings of 21st ACM Symposium on Theory of Computing, May 1989, pp. 33-43.

[276] Naor, M., Yung, M., "Pubhc-key cryptosystems provably secure against chosen ciphertext attacks". Proceedings of 22nd ACM Symposium on Theory of Computing, May 1990, pp. 427-437.

[277] National Bureau of Standards, "Data Encryption Standard", Federal Information ProcessingS.tandard, U. S. Departmeдt of Com-merce, FIPS PUB 46, Washington, DC, 1977.

[278] National Bureau of Standards, "DES modes of operation". Federal Information Processing Standard, U. S. Department of Commerce, FIPS PUB 81, Washington, DC, 1980.

[279] Nechvatal, j., "Pubhc key cryptography", в: [333], 1992, pp. 177-288.

[280] Newman, D. В., Jr., Pickholtz, R. L., "Cryptography in the private sector", IEEE Communications Magazine, vol. 24, 1986, pp. 7-10.

[281] Odlyzko, A.m., "Discrete logarithms in fmite fields and their cryptographic significance", Advances in Cryptology: Proceedings of Crypto 84, August 1984, Springer - Verlag, pp. 225-314.

[282] Orton, G.A., Roy, M. P., Scott, P. A., Peppard, L.E., Tavares, S. E., "VLSI implementation of pubhc-key encryption algorithms". Advances in Cryptology - Crypto 86 Proceedings, August 1986, Springer-Verlag, pp. 277-301.

[283] Ostrovsky, R., "An efficient software protection, scheme". Advances in Cryptology .Crypto89 Proceedings,Augaat 1989, Springer-Verlag, pp. 610-611.