Welcome to the resource topic for 2020/734
Title:
Mirror Theory: A simple proof of the Pi+Pj Theorem with xi_max=2
Authors: Benoît Cogliati, Jacques Patarin
Abstract:We provide a simple and complete proof of the famous Pi⊕Pj Theorem in the particular case where ξmax=2. This Theorem gives a lower bound for the number of solutions of simple linear systems of equations in the case where all the variables have to be pairwise distinct. Such systems often occur in cryptographic proofs of security, and this particular Theorem can be used to prove that the function x↦P(0||x)⊕P(1||x) is an optimally secure pseudorandom function when P is a uniformly random permutation.
ePrint: https://eprint.iacr.org/2020/734
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .