Improved Security Bounds for Pseudorandom Permutations

@inproceedings{Patarin1997ImprovedSB,
  title={Improved Security Bounds for Pseudorandom Permutations},
  author={Jacques Patarin},
  booktitle={ACM Conference on Computer and Communications Security},
  year={1997}
}
This paper is a continuation of the work iuitiated in [2] by M. Luby and C:. Rackoff on pseudorandoul function and permutations. The objective of this paper is to study pseudorandoxu functiou generators and pseudoraudoul pernmtation generators that are proven secure against an euenly that can perforul unhuited computation.. but has only access to a limited nuulber of cleartext/ciphertext pairs. Moreover, lie can “dynauiically” choose these pairs. 111 sectiou 4, we describe some improvements on… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS

Similar Papers

Loading similar papers…