CRT-Secret Sharing

Chinese Remainder Theorem based Secret-Sharing

Summary

  • CRT (see Chinese Remainder Theorem) states that an integer can be uniquely derived given modulus \(k\) co-prime numbers such that their product is (strictly) larger than \(m\).

  • From [1]

    _20250114_153817screenshot.png

    Figure 1: CR Code

Sharing

Reconstruction

Notes

  • First introduced to me by [2]
  • First introduced here: [1]