Cryptology ePrint Archive: Report 2013/368
Available versions in chronological order
20130610:201853 (posted 10-Jun-2013 20:18:53 UTC)
Security in $O(2^n)$ for the Xor of Two Random Permutations\\ -- Proof with the standard $H$ technique--
Jacques Patarin
20130712:103655 (posted 12-Jul-2013 10:36:55 UTC)
Security in $O(2^n)$ for the Xor of Two Random Permutations\\ -- Proof with the standard $H$ technique--
Jacques Patarin
[
Cryptology ePrint archive
]