Cryptology ePrint Archive: Report 2008/010

Available versions in chronological order

20080107:165009 (posted 07-Jan-2008 16:50:09 UTC): A Proof of Security in O(2^n) for the Xor of Two Random Permutations; Jacques Patarin
20080109:174546 (posted 09-Jan-2008 17:45:46 UTC): A Proof of Security in O(2^n) for the Xor of Two Random Permutations; Jacques Patarin
20080530:153559 (posted 30-May-2008 15:35:59 UTC): A Proof of Security in O(2^n) for the Xor of Two Random Permutations; Jacques Patarin
20130610:150555 (posted 10-Jun-2013 15:05:55 UTC): A Proof of Security in $O(2^n)$ for the Xor of Two Random Permutations\\ -- Proof with the ``$H_{\sigma}$ technique''--; Jacques Patarin
20140109:182542 (posted 09-Jan-2014 18:25:42 UTC): A Proof of Security in $O(2^n)$ for the Xor of Two Random Permutations\\ -- Proof with the ``$H_{\sigma}$ technique''--; Jacques Patarin