Cryptology ePrint Archive: Report 2013/368

Available versions in chronological order


Security in $O(2^n)$ for the Xor of Two Random Permutations\\ -- Proof with the standard $H$ technique--
Jacques Patarin

Security in $O(2^n)$ for the Xor of Two Random Permutations\\ -- Proof with the standard $H$ technique--
Jacques Patarin


[ Cryptology ePrint archive ]