Научная литература
booksshare.net -> Добавить материал -> Физика -> Брассар Ж. -> "Современная криптология " -> 66

Современная криптология - Брассар Ж.

Брассар Ж. Современная криптология — М.: ПОЛИМЕД, 1999. — 178 c.
Скачать (прямая ссылка): sovremennayakritologiya1999.pdf
Предыдущая << 1 .. 60 61 62 63 64 65 < 66 > 67 .. 68 >> Следующая


[338] SMITH, К., “Watch out hackers, public encryption chips are coming”, Electronic Week, 20 May 1985, pp. 30-31.

[339] Solovay, R., Strassen, V., “A fast Monte Carlo test for primali-ty”, SIAM Journal on Computing, vol. 6, 1977, pp. 84-85; erratum в: ibid, vol. 7, 1978, p. 118.

[340] Stewart, I., “Schrodinger’s catflap”, News and Views, Nature, vol. 353, 3 October 1991, pp. 384-385.

[341] Stinson, D. R-, “Cryptography: Theory and Practice”, CRC Press, 1995.

[342] TEDRICK, Т., “How to exchange half a bit”, Advances in Cryptology: Proceedings of Crypto 83, August 1983, Plenum Press, pp. 147- 151.

[343] TEDRICK, Т., “Fair exchange of secrets”, Advances in Cryptology: Proceedings of Crypto 84, August 1984, Springer - Verlag, pp. 434-438.

[344] van TlLBORG, H. C. A., An Introduction to Cryptology, Kluwer Academic Publishers, Hingham, MA, 1988.

[345] Томра, М., “Zero knowledge interactive proofs of knowledge (a digest)”, научно-исследовательский отчет RC 13282 (#59389), IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY, 1987.

[346] ТоМРА, М., Woll, H., “Random self-reducibility and zero-knowledge interactive proofs of possession of information”, Proceedings of 28th IEEE Symposium on Foundations of Computer Science, October 1987, pp. 472-482.

[347] TUCHMAN, W., представлено на National' Computer Conference, Anaheim, CA, June 1978.

[348] Tuchman, W., “Hellman presents no shortcut solution to the DES”, IEEE Spectrum, v6l. 16, July 1979, pp. 40- 41.
Литература

171

[349] VAZIRANI, U. V., VaziraNI, V. V., “Trapdoor pseudo-random number generators with applications to protocol design”, Proceedings

, of 24th IEEE Symposium on Foundations of Computer Science, November 1983, pp. 23-30.

[350] VAZIRANI, U.V., VaziraNI, V. V., “Efficient and secure pseudorandom number generation”, Proceedings of 25th IEEE Symposium on Foundations of Computer Science, October 1984, pp. 458-463.

[351] Verbauwhede, I., Hoornaert, F., Vandewalle, J., De Man, H., “Security considerations in the design and implementation of a new DES chip”, Advances in Cryptology — Eurocrypt’87 Proceedings, April 1987, Springer - Verlag, pp. 287-300.

[352] VERNAM, G.S., “Cipher printing telegraph systems for secret wire and radio telegraphic communications”, Journal of the American Institute of Electrical Engineers, vol. XLV, 1926, pp. 109-115.

[353] VOLTAIRE, Dictionnaire philosophique, 1769.

[354] Wallich, P., “Quantum cryptography”, Scientific American, May 1989, pp. 28-30.

[355] Wegman, M.N., CARTER, J.L., “New hash functions and their use in authentication and set equality”, Journal of Computer and System Sciences, vol. 22, 1981, pp. 265-279.

[356] WIENER, M. J., “Cryptanalysis of short RSA secret exponents”, IEEE Transactions on Information Theory, vol. IT-36, 1990, pp. 553-558.

[357] WlESNER, S., “Conjugate coding”, Sigact News, vol. 15, no. 1, 1983, pp. 78 - 88; оригинальная рукопись, написанная примерно в 1970 году.

[358] Wilkes, M.V., Time-Sharing Computer Systems, American Elsevier, New York, NY, 1975.

[359] Williams, D., Hindin, H. J., “Can software do encryption job?”, Electronics, 3 July 1980, pp. 102 -103.

[360] Williams, H. C., “A modification of the RSA public-key encryption procedure”, IEEE Transactions on Information Theory, vol. IT-26, 1980, pp. 726 - 729.

[361] WOOTTERS, W. K., ZuREK, W. H-, “A single quantum cannot be cloned”, Nature, vol. 299, 1982, pp. 802-8бз.

[362] Wright, P., SpyCatcher, Viking Penguin Inc., New York, NY, 1987.

[363] Wyner, A. D., “The wire-tap channel”, Bell System Technical Journal, vol. 54, 1975, pp. 1355-1387.
172

Литература

[364] Yao, А. С.-С., “Theory and applications of trapdoor functions”, Proceedings of 23rd IEEE Symposium on Foundations of Computer Science, November 1982, pp. 80-91.

[365] Yao, A. C.-C., “Protocols for secure computations”, Proceedings of 23rd IEEE Symposium on Foundations of Computer Science, November 1982, pp. 160-164.

[366] Yao, A. C.-C., “How to generate and exchange secrets”, Proceedings of 27th IEEE Symposium on Foundations of Computer Science, October 1986, pp. 162 -167.

[367] YaRDLEY, H. O., The American Black Chamber, Bobbs Merrill, Indianapolis, IN, 1931; перепечатано в: Ballantine Books, New York, NY.

[368] Yiu, K., Peterson, K., “A single-chip VLSI implementation of the discrete exponential public key distribution system”, Proceedings of IEEE Global Telecommunications Conference, vol. 1, 1982, pp. 173-179.

[369] Yung, М., “Cryptoprotocols: Subscription to a public key, the secret blocking and the multi-player mental poker game”, Advances in Cryptology: Proceedings of Crypto 84, August 1984, Springer-Verlag, pp. 439-453.

[370] Yung, М., “A secure and useful keyless cryptosystem”, Information Processing Letters, vol. 21, 1985, pp. 35-38.

[371] ZlMMER, C., “Perfect gibberish”, Discover, September 1992, pp. 92-99.

[372] Zorpette, G., “Breaking the enemy’s code”, IEEE Spectrum, September 1987, pp. 47-51.
Предыдущая << 1 .. 60 61 62 63 64 65 < 66 > 67 .. 68 >> Следующая

Реклама

c1c0fc952cf0704ad12d6af2ad3bf47e03017fed

Есть, чем поделиться? Отправьте
материал
нам
Авторские права © 2009 BooksShare.
Все права защищены.
Rambler's Top100

c1c0fc952cf0704ad12d6af2ad3bf47e03017fed