So I am a computer science student and have some problems reading cryptographic mathematics notations, so I need help from mathematicians. I was reading a 2018 IEEE journal about identity-based data integrity checking, and was met with this:
...Assume the user's identity is l-bit, which is described as
$ID = (ID_1, ID_2, ID_3, ..., ID_l) \in \{0,1\}^l$
...
I searched about sets with powers, sets of elements with powers, but garnered no useful results. I remembered about this in automata course, which more or less translates that to this:
On a set of l amount of ID, each ID is constructed with l digits of 0s and 1s.
But I'm still skeptical about that, am I wrong?
Thank you!
1. If $l=2$ we have $ID=(ID_1,ID_2)\in {0,1}^2$. And we can write ${0,1}^2={(0,0), (0,1), (1,0), (1,1)}$, so we end up with $$ ID=(ID_1,ID_2)\in {(0,0), (0,1), (1,0), (1,1)} \quad ? $$
2. Does this now mean $ID_1$ and $ID_2$ can be $0$ OR $1$? So we end up with the following possibilities: \begin{align} (ID_1,ID_2)&=(0,0), , \ (ID_1,ID_2)&=(0,1)\ (ID_1,ID_2)&=(1,0)\ (ID_1,ID_2)&=(1,1) \end{align}
Thanks!
– JDoeDoe Feb 05 '20 at 20:15