Welcome to the resource topic for 2010/287
Title:
Introduction to Mirror Theory: Analysis of Systems of Linear Equalities and Linear Non Equalities for Cryptography
Authors: Jacques Patarin
Abstract:\begin{abstract} In this paper we will first study two closely related problems:\ 1. The problem of distinguishing f(x\Vert 0)\oplus f(x \Vert 1) where f is a random permutation on n bits. This problem was first studied by Bellare and Implagliazzo in~\cite{BI}.\ 2. The so-called Theorem $P_i \oplus P_j$'' of Patarin (cf~\cite{P05}). Then, we will see many variants and generalizations of this Theorem P_i \oplus P_j‘’ useful in Cryptography. In fact all these results can be seen as part of the theory that analyzes the number of solutions of systems of linear equalities and linear non equalities in finite groups. We have nicknamed these analysis ``Mirror Theory’’ due to the multiples induction properties that we have in it. \end{abstract}
ePrint: https://eprint.iacr.org/2010/287
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 .