Secret sharing using the Chinese remainder theorem
id:
secret-sharing-using-the-chinese-remainder-theorem-318-14291724
title:
Secret sharing using the Chinese remainder theorem
text:
Secret sharing consists of recovering a secret S from a set of shares, each containing partial information about the secret. The Chinese remainder theorem (CRT) states that for a given system of simultaneous congruence equations, the solution is unique in some Z/nZ, with n > 0 under some appropriate conditions on the congruences. Secret sharing can thus use the CRT to produce the shares presented in the congruence equations and the secret could be recovered by solving the system of congruences t
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Secret_sharing_using_the_Chinese_remainder_theorem
date created:
date modified:
2023-11-23T16:25:42Z
main entity:
{"identifier":"Q4447674","url":"https://www.wikidata.org/entity/Q4447674"}
image:
fields total:
13
integrity:
13