0
$\begingroup$

Hi,

Here is a question in cryptography which is probably naive, and a reference request.

Suppose I have 3 matrices(I1, I2, and I3 -same size) that I want to combine them some how(? do not know yet) to create a matrix called R. I need to find a way to be able to reconstruct R with any two of Is. Or I create an intermediate matrix T where I can use T and any of the Is to create R. I am looking for an approach that can be extended to more than 3. I thought of simple weighted addition or multiplication which are easy to crack and I am looking for other ways of doing it.

Thanks

$\endgroup$
4
  • $\begingroup$ try math.stackexchange.com/questions?sort=active $\endgroup$
    – Will Jagy
    Sep 5, 2012 at 19:44
  • $\begingroup$ This is off topic here (since it's not really a research question in mathematics), but if I understand the question right then "secret sharing" may be what you're looking for. $\endgroup$
    – Henry Cohn
    Sep 5, 2012 at 19:55
  • $\begingroup$ @will: Thanks. I'll try there. @Henry: This one is something similar to the reverse of secret sharing where you want to reach one matrix from 3 not creating 3 matrix forom one. Secret sharing is not an efficient way of doing it specially for large number of elements in a big matrix. I am looking for an efficient algorithms $\endgroup$
    – Shanti
    Sep 5, 2012 at 20:31
  • 1
    $\begingroup$ Oops, I misread the problem, sorry. But now it sounds impossible to me: if R can be reconstructed from any two of the I's, no matter what the third one is, then it can't depend on any of them (and must be constant). $\endgroup$
    – Henry Cohn
    Sep 6, 2012 at 2:12

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.