A Proof of Security in O(2^n) for the Xor of Two Random Permutations

Jacques Patarin. A Proof of Security in O(2^n) for the Xor of Two Random Permutations. IACR Cryptology ePrint Archive, 2008:10, 2008. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.