Paper 2013/368
Security in for the Xor of Two Random Permutations\ -- Proof with the standard technique--
Jacques Patarin
Abstract
Xoring two permutations is a very simple way to construct pseudorandom functions from pseudorandom permutations. In~\cite{P08a}, it is proved that we have security against CPA-2 attacks when
Note: A section and an appendix have been added
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Unknown status
- Keywords
- Pseudorandom functionspseudorandom permutationssecurity beyond the birthday boundLuby-Rackoff backwards.
- Contact author(s)
- valerie nachef @ u-cergy fr
- History
- 2016-02-22: last of 2 revisions
- 2013-06-10: received
- See all versions
- Short URL
- https://ia.cr/2013/368
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2013/368, author = {Jacques Patarin}, title = {Security in $O(2^n)$ for the Xor of Two Random Permutations\\ -- Proof with the standard $H$ technique--}, howpublished = {Cryptology {ePrint} Archive, Paper 2013/368}, year = {2013}, url = {https://eprint.iacr.org/2013/368} }