Stavros
Reputation
380
Next privilege 500 Rep.
Access review queues
 Jul 26 revised Proving the properties of big union of unions for indexed sets edited body Jul 26 answered Proving the properties of big union of unions for indexed sets Jul 26 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}$. Jul 26 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 Jul 26 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$ Jul 26 answered Need help with checking my proof related to equivalence mod n. Jul 2 awarded Curious Mar 15 awarded Notable Question Feb 11 awarded Notable Question Jan 9 awarded Citizen Patrol Sep 25 awarded Popular Question Sep 2 accepted If the symmetric difference of $A$ and $B$ is contained in $A$, then $A$ contains $B$ Sep 2 accepted Is $3^n - 2^n$ composite for all integers $n \geq 6$? Sep 2 accepted Is there a relation which is neither symmetric nor antisymmetric? Sep 1 accepted Prove that \$D_r \circ D_s = \{ (x,y) \in \mathbb{R}^2 \ | \ |x-y|