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

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

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


[188] Glass, A. S., “Could the smart card be dumb ?”, Abstracts of Papers from Eurocrypt 86, ISBN 91-7870-077-9, 1986, pp. 1.5A-1.5B.

[189] Gleik, J., “A new approach to protecting secrecy is discovered”, New York Times, 17 February 1987, p. Cl.

[190] GOLDREICH, O., “Two remarks concerning the Goldwasser-Micali-Rivest signature scheme”, Advances in Cryptology — Crypto ’86 Proceedings, August 1986, Springer - Verlag, pp. 104-110.

[191] GOLDREICH, O., “Towards a theory of software protection and simulation by oblivious RAM’s”, Proceedings of 19th ACM Symposium on Theory of Computing, May 1987, pp.. 182 -194.

[192] Goldreich, O'., Goldwasser, S., Micali, S., “On the cryptographic applications of random functions”, Advances in Cryptology: Proceedings of Crypto 84, August 1984, Springer - Verlag, pp. 276-288.
Литература

159

[193] Goldreich, О., Goldwasser, S., Micali, S., “How to construct random functions”, Journal of the ACM, vol. 33, 1986, pp. 792 - 807.

[194] -GOLDREICH, IО?, Krawczyk, H., “On the composition bf zero-knowledge proof systems”, Proceedings of 17th International Conference on Automata, Languages and Programming, 1990, Springer -Verlag, pp. 268-282.

[195] Goldreich, O., Micali, S., Wigderson, A., “How to play any mental game, or: A completeness theorem for protocols with honest majority”, Proceedings of 19th ACM Symposium on Theory of Computing, May 1987, pp. 218-229.

[196] Goldreich, O., Micali, S., Wigderson, A., “Proofs that yield nothing but their validity, or All languages in M“P have zero-knowledge proof systems”, Journal of the ACM, vol. 38, 1991, pp. 691 - 729.

[197] Goldwasser, S., Micali, S., “Probabilistic encryption and how to play mental poker keeping secret all partial information”, Proceedings of 14th ACM Symposium on Theory of Computing, May 1982, pp. 365-377.

[198] Goldwasser, S., MlCALI, S., “Probabilistic encryption”, Journal of Computer and System Sciences, vol. 28, 1984, pp. 270-299.

[199] Goldwasser, S., Micali, S., Rackoff, C., “The knowledge complexity of interactive proof-systems”, SIAM Journal on Computing, vol. 18, 1989, pp. 186-208.

[200] Goldwasser, S., Micali, S., Rivest, R., “A digital signature scheme secure against adaptive chosen-message attacks”, SIAM Journal on Computing, vol. 17, 1988, pp. 281-308.

[201] Goldwasser, S., Micali, S., Yao, A. C.-C., “On signatures and authentication”, Advances in Cryptology: Proceedings of Crypto 82, August 1982, Plenum Press, pp. 211-215.

[202] Good, I. J., “Pioneering work on computers at Bletchley”, в: A History of Computing in the Twentieth Century, N. Metropolis, J. Howlett, G.-C. Rota (editors), Academic Press, New York, NY, 1980, pp. 31-46; а также в: Annals of the History of Computing, vol. 1, 1979, pp. 38-48.

[203] Gordon, J. A., “Strong primes are easy to find”, Advances in Cryptology: Proceedings of Eurocrypt 84, April 1984, Springer- Verlag, pp. 216-223.

[204] Gottlieb, A., “Conjugal secrets — The untappable quantum telephone”, The Economist, vol. 311, 22 April 1989, p. 81.
160

Литература

[205] Govaerts, R., Vandewalle, J., Bosselaers, A., Preneel, B., “Fast software implementation of the Data Encryption Standard (DES)”, труды отчета ESAT/COSMIC, Katholieke Universiteit Leuven, Belgique, 1990.

[206] van de Graaf, J., Peralta, R., “A simple and secure way to show the validity of your public key”, Advances in Cryptology — Crypto ’87 Proceedings, August 1987, Springer - Verlag, pp. 128-134.

[207] GROLLMANN, J., SelMAN, A. L., “Complexity measures for public-key cryptosystems”, SIAM Journal on Computing, vol. 17, 1988, pp. 309 — 335.

[208] Guillou, L. C., Davio, М., Quisquater, J.-J., “Public-key techniques: Randomness and redundancy”, Cryptologia, vol. XIII, 1989, pp. 167-189.

[209] Guillou, L.C., Ugon, М., Quisquater, J.-J., “The smart card: A standardized security device dedicated to public cryptography”, в: [333], 1992, pp. 561-613.

[210] Hastad, J., “On using RSA with low exponent in a public key network”, Advances in Cryptology — Crypto’85 Proceedings, August 1985, Springer - Verlag, pp. 403-408.

[211] Hastad, J., “Pseudo-random generation under uniform assumptions” , Proceedings of 22nd ACM Symposium on Theory of Computing, May 1990, pp. 395 - 404.

[212] HELLMAN, М. Е., “An extension of the Shannon theory approach to cryptography”, IEEE Transactions on Information Theory, vol. IT-23, 1977, pp. 289-294.

[213] Hellman, М. Е., “DES will be totally insecure within ten years”, IEEE Spectrum, vol. 16, July 1979, pp. 32-39.

[214] Hellman, М. E., “The mathematics of public-key cryptography”, Scientific American, August 1979, pp. 146-157.

[215] Hellman, М. E., Merkle, R. C., Schroeppel, R., Washington, L., Diffie, W., Pohlig, S., Schweitzer, P., “Results on an initial attempt to cryptanalyze the NBS Data Encryption Standard”, технический отчет SEL 76-042, Stanford University, 1976.

[216] HERZBERG, A., PlNTER, S. S., “Public protection of software”, Advances in Cryptology — Crypto ’85 Proceedings, August 1985, Springer - Verlag, pp. 158-179.
Предыдущая << 1 .. 55 56 57 58 59 60 < 61 > 62 63 64 65 66 67 .. 68 >> Следующая

Реклама

c1c0fc952cf0704ad12d6af2ad3bf47e03017fed

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

c1c0fc952cf0704ad12d6af2ad3bf47e03017fed