Stavros
Reputation
370
Next privilege 500 Rep.
Access review queues
 Jul26 revised Proving the properties of big union of unions for indexed sets edited body Jul26 answered Proving the properties of big union of unions for indexed sets Jul26 comment If the same message is sent to Alice and Bob who are using different public keys, how can somoene following the channel find $m$ It's just an application of CRT. We know that $N_1$ and $N_2$ are relative prime. Then, for the given sequence of integers $c_1, c_2$, there exists an integer $x$ solving the system of the following simultaneous congruences: $x \equiv c_1\pmod {N_1}$ and $x \equiv c_2\pmod {N_2}$. Jul26 revised If the same message is sent to Alice and Bob who are using different public keys, how can somoene following the channel find $m$ added 1 character in body Jul26 answered If the same message is sent to Alice and Bob who are using different public keys, how can somoene following the channel find $m$ Jul26 answered Need help with checking my proof related to equivalence mod n. Jul2 awarded Curious Mar15 awarded Notable Question Feb11 awarded Notable Question Jan9 awarded Citizen Patrol Sep25 awarded Popular Question Sep2 accepted A proof by contradiction Sep2 accepted Is $3^n - 2^n$ composite for all integers $n \geq 6$? Sep2 accepted Is there a relation which is neither symmetric nor antisymmetric? Sep1 accepted Prove that \$D_r \circ D_s = \{ (x,y) \in \mathbb{R}^2 \ | \ |x-y|