Improved security bounds for pseudorandom permutations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Improved security bounds for pseudorandom permutations

Full text

Pdf (1.16 MB)

Source

Conference on Computer and Communications Security archive
Proceedings of the 4th ACM conference on Computer and communications security table of contents

Zurich, Switzerland

Pages: 142 - 150

Year of Publication: 1997

ISBN:0-89791-912-2

Author

Jacques Patarin

CP8 Transac, 68 route de Versailles - BP 45, 78431 Louveciennes Cedex - France

Sponsor

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 46, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	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/266420.266452 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.

	1	W. Aiello and R. Venkatesan, "Foiling birthday attacks in length-doubling transformations". Eurocrypt'96, Springer-Verlag, pp. 307-320.
	2	Michael Luby , Charles Rackoff, How to construct pseudorandom permutations from pseudorandom functions, SIAM Journal on Computing, v.17 n.2, p.373-386, April 1988 [doi>10.1137/0217022]
	3	Ueli M. Maurer , James L. Massey, Perfect local randomness in pseudo-random sequences, Proceedings on Advances in cryptology, p.100-112, July 1989, Santa Barbara, California, United States
	4	U. Maurer, "A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators". Eurocrypt'92, Springer-Verlag, pp. 239-255.
	5	Jacques Patarin, New Results on Pseudorandom Permutation Generators Based on the DES Scheme, Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, p.301-312, August 11-15, 1991
	6	J. Patarin, "How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function". Eurocrypt'92, Springer-Verlag, pp. 256-266.
	7	J. Patarin, "Etude des generateurs de permutations bases sur le schema du DES" . Ph. D. Thesis, Inria, Domaine de Voluceau, Le Chesnay, France, 1991.
	8	Josef Pieprzyk, How to construct pseudorandom permutations from single pseudorandom functions, Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology, p.140-150, February 1991, Aarhus, Denmark
	9	C. P. Schnorr, On the construction of a random number generator and random function generators, Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88, p.225-232, April 1988, Davos, Switzerland
	10	C.E. Shannon, "A mathematical theory of communication". Bell System Technical Journal, Vol. 27, n03, July 1948, pp. 379-423 and 623-656.
	11	Yuliang Zheng , Tsutomu Matsumoto , Hideki Imai, On the construction of block ciphers provably secure and not relying on any unproved hypotheses (extended abstract), Proceedings on Advances in cryptology, p.461-480, July 1989, Santa Barbara, California, United States
	12	Yuliang Zheng , Tsutomu Matsumoto , Hideki Imai, Impossibility and optimally results on constructing pseudorandom permutations (extended abstract), Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology, p.412-422, November 1990, Houthalen, Belgium