Pseudo-random permutation generators and cryptographic composition

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Pseudo-random permutation generators and cryptographic composition

Full text

Pdf (609 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the eighteenth annual ACM symposium on Theory of computing table of contents

Berkeley, California, United States

Pages: 356 - 363

Year of Publication: 1986

ISBN:0-89791-193-8

Authors

M Luby	Department of Computer Science, University of Toronto, Toronto, Canada M5S 1A4
C Rackoff	Department of Computer Science, University of Toronto, Toronto, Canada M5S 1A4

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 66, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/12130.12167 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Ba	Bamford, J., The Puzzle Palace." A Report on America's Most Secret Agency, Penguin Books Publishers, 1983
	BM	Blare, M., Micali, S., How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits, J~, f l?gq), SIAM Journal of Computing, preliminary version in 23 rd Annual Symposium on Foundations of Computer Science, November 3-5, 1982, pp 112-117
	De	Dorothy Elizabeth Rob Denning, Cryptography and Data Security, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1982
	GGM	Goldreich, 0., Goldwasser, S., Micali, S., How to Construct Random Functions, Proceedings of the 25 th Annual Symposium on Foundations of Computer Science, October 24-26, 1984
	Hod	Hodges, A., _41an Turing: The Enigma of Intelligence, Unwin Paperbacks, 1985
	Yao	Yao, A.C., Theory and Applications of Trapdoor Functions,23 rd Annual Symposium on Foundations of Computer Science, November 3-5, 1982, pp 112-117

CITED BY 6

	Oded Goldreich , Rafail Ostrovsky, Software protection and simulation on oblivious RAMs, Journal of the ACM (JACM), v.43 n.3, p.431-473, May 1996
	O. Goldreich, Towards a theory of software protection and simulation by oblivious RAMs, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.182-194, January 1987, New York, New York, United States
	Oded Goldreich , Shafi Goldwasser , Silvio Micali, How to construct random functions, Journal of the ACM (JACM), v.33 n.4, p.792-807, Oct. 1986
	R. Impagliazzo , S. Rudich, Limits on the provable consequences of one-way permutations, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.44-61, May 14-17, 1989, Seattle, Washington, United States
	Ruoming Pang , Mark Allman , Vern Paxson , Jason Lee, The devil and packet trace anonymization, ACM SIGCOMM Computer Communication Review, v.36 n.1, January 2006
	Vasilios Katos , Bernard Doherty, Exploring confusion in product ciphers through regression analysis, Information Sciences: an International Journal, v.177 n.8, p.1789-1795, April, 2007