سبحان الله و بحمده سبحان الله العظيم ❤️
← BACK TO WRITEUPSProtocol over Galois Rings GR(2^k, D) — 5 stages
Two representations of the same Galois ring (R₁ tower extension, R₂ single extension). A secret polynomial P(x) is evaluated at a random point pt₁ ∈ R₁. We submit pt₂ ∈ R₂, get P(pt₂), and must recover coefficients of P(pt₁) in R₁.
| Stage | k | Extensions | Degree |
|---|---|---|---|
| 1 | 2 | [2,3] | 6 |
| 2 | 8 | [2,3] | 6 |
| 3 | 8 | [2,3,5] | 30 |
| 4 | 32 | [3,4,5] | 60 |
| 5 | 64 | [4,3,5] | 60 |
Since R₁ ≅ R₂, let φ: R₁ → R₂ be the isomorphism. Setting pt₂ = φ(pt₁), the server gives coefficients of y = φ(P(pt₁)). This reduces to solving M·x = y (mod 2^k) where M is the matrix representing φ.