[284] Peleg, S., Rosenfeld, A., "Breaking substitution ciphers using a relaxation algorithm", Communications of the ACM, vol. 22, 1979, pp. 598-605. I.,..

[285] Peralta, R., "Simultaneous security of bits in the discrete log". Advances in Cryptology - Crypto 85 Proceedings, August 1985, Springer-Verlag, pp. 62-72.

[286] Peterson, I., "Bits of uncertainty: Quemtum security". Science News, vol.137, 2 June 1990, pp. 342 - 343.

[287] Poe, E. a., "The Gold-Bug", Dollar Newspaper, 21 & 28 June 1843; напечатгшо в различных сборниках рассказов Эдгара По; имеются также многочисленные русские издгшия, например, в: Эдгар По, Избранные произведения в двух томах, М., Художественная литература, 1972, т. 2, стр. 157-191.

[288] Pohlig, S., Hellman, М. Е., "An improved algorithm for computing logarithms over GF(p) and its cryptographic significance", IEEE Transactions on Information Theory, vol. IT-24, 1978, pp. 106- 110.

[289] PoMERANCE, C., "Recent developments inprimaUty testing". Mathematical Intelligencer, vol. 3, 1981, pp. 97-105.

[290], pomerance, C., Змггн, J. W., TuLER, R., "A pipe-fine architec-tiu-e for factoring large integers with the quadratic sieve algorithm, SIAM Journal on Computing, vol. 17, 1988, pp. 387 - 403.

[291] purdy, G. В., "A high security log-in procedure", Communications of the ACM, vol. 17, 1974, pp. 442-445.

[292] Quisquater, J.-J., Couvreur, C., "Fast decipherment algorithm for RSA pubhc-key cryptosystem", Electronic Letters, vol. 18, 1982, pp. 905 - 907.

[293] Quisquater, J.-J., Delvaux, Y., Notes sur la cryptographic et la securite, Phifips Research Laboratory, Bruxelles, Belgique, 1988.

[294] Quisquater, J.-J., Desmedt, Y. G., "Chinese lotto as an exhaustive code-breaking machine". Computer, vol. 24, 1991, pp. 14-22.

[295] Quisquater, J,-J., M., M. & M. and Guillou, L.C, M.a., G., A., G. & S., "How to explcun zero-knowledge protocols to уош-children", Advances in Cryptology - Crypto 89 Proceedings, August 1989, Springer-Verlag, pp. 628 - 631.

[296] Rabin, M. O., "Digital signatures", к Foundations of Secure Computation, R.A. DeMiilo, D.P. Dobkin, A.K. Jones, R.J. Lipton (editors). Academic Press, New York, NY, 1978, pp. 155-168.

[297] Rabin, М.О., "Digital signatures and pubUc-key functions as intractable as factorization", техническжй отчет МГГ/ЬСЗ/ТК-гхг, Massachusetts Institute of Technology, 1979.

[298] Rabin, M. O., "Probabihstic algorithm for testing primahty". Journal of Number Theory, vol. 12, 1980, pp. 128-138.

[299] Rabin, M. O., "How to exchcinge secrets by obhvious transfer", технический отчет TR-81, Aiken Computation Laboratory, Нгиг-vcird University, 1981.

[300] Rabin, M. O., "Transaction protection by beacons". Journal of Computer and System Sciences, vol. 27, 1983, pp. 256-267.

[301] Rabin, Т., Ben-Or, M., "Verifiable secret sharing and multiparty protocols with honest majority". Proceedings of 21st ACM Symposium on Theory of Computing, May 1989, pp. 73 - 85.

[302] Randell, В., "The Colossus", b: A History of Computing in the Twentieth Century, N. Metropolis, J. Hewlett, G.-C. Rota (editors). Academic Press, New York, NY, 1980, pp. 47-92.

[303] Rejewski, M., "How Pohsh mathematicians deciphered the Enigma", Annals of the History of Computing, vol. 3, 1981, pp. 213-234.

[304] Rivest, R. L., "A description of a single-chip implementation of the RSA cipher". Lambda Magazine, vol. 1, 1980, pp. 14-18.

[305] Rivest, R. L., "A short report on the RSA chip". Advances in Cryptology: Proceedings of Crypto 82, August 1982, Plenum Press, 1983, p. 327.

[306] Rivest, R. L., "Cryptology", в: Algorithms and Complexity: Handbook of Theoretical Computer Science, vol. A, J. van Leeuwen (editor), Elsevier Science Pubhshers B.V.&The MIT Press, 1990, pp. 719 - 755.

[307] Rivest, R.L., Shamir, A., Adleman, L.M., "A method for ob-tctining digital signatures and pubhc-key cryptosystems". Communications of the ACM, vol. 21, 1978, pp. 120-126.

[308] Rivest, R. L., Sherman, A. Т., "Randomized encryption techniques". Advances in Cryptology: Proceedings of Crypto 82, August 1982, Plenum Press, pp. 145-163.

[309] Robert, J.-M., Detection et correction derreurs en cryptographie, memoire de maitrise, Dep2trtement dinformatique et de recherche operationnelle, Universite de Montreal, 1985.

[310] RoMPEL, J., "One-way functions are necessary and sufficient for sec4i¥ signatiures", Proceedings of 22nd ACM Symposium on Theory ,«af,<P<p«imfli, May 199Q„pp,7:-394. jcy

[311] Salvail, L., Le ргоЫёте de reconciliation en cryptographic, memoire de maatrise, Depeirtement dinformatique et de recherche operationnelle, Universite de MontreeJ, 1991.

[312] Schneier, B, Applied Cryptology, second edition, John Wiley & Sons, New York, N. Y., 1995.

[313] ScHHJDFT, A.W., Shamir, A, "The discrete log is very discreet". Proceedings of 22nd ACM Symposium on Theory of Computing, May 1990, pp. 405-415.

[314] Sedlak, H., "The RSA cryptography processor: The first very high speed one-chip solution". Advances in Cryptology - Eurocrypt87 Proceedings, April 1987, Springer - Verlag, pp. 95-105.

[315] Shamir, A., "How to share a secret". Communications of the ACM, vol. 24, 1979, pp. 612-613.

[316] Shamir, A., "On the generation of cryptographically strong pseudorandom sequences", ACM Transactions on Computer Systems, vol. 1, 1983, pp. 38 - 44.

[317] Shamir, A., "A polynomial \Гте algorithm fSr breakiiigtHBasic Merkle-Hellman cryptosystem", IEEE Transactions on Information Theory, vol. IT-30, 1984, pp. 699 - 704.

[318] Shamir, A., "Identity based cryptosystems and signature schemes", Advances in Cryptology: Proceedings of Crypto 84, August 1984, Springer - Verlag, pp. 47-53.

[319] Shamir, A., "On the security of the DES", Advances in Cryptology - Crypto 85 Proceedings, August 1985, Springer - Verlag, pp. 280-281.

[320] Shamir, A., "IT? = VSVACE, Proceedings of 31st IEEE Symposium on Foundations of Computer Science, October 1990, pp. 11-15.

[321] Shamir, A., Rivest, R.L., Adleman, L. M., "Mental poker", в: Mathematical Gardner, D. E. Klarner (editor), Wadsworth Intema-tioneJ, Belmont, CA, 1981, pp. 37-43; (есть русский перевод в: Матемагпический tjeem«UK, Д. А. Кларнер(<ст. и ред.), М,, Мир, 1984, стр. 58-66).

[322] Shand, М:, Bertin, Р., Vijillemin, J., "rdware speedups m long mteger multiplication", Proceedings of 2nd ACM Symposium on Parallel Algorithms and Architectures, July 1990, pp. 138-145.