recategorized by
871 views
1 votes
1 votes
Assume when encrypting $3$-bit plaintext with a block cipher with key $\text{K},$ the following ciphertext is obtained:
$$\begin{array}{|c|c|}
\hline \text{Plaintext} & \text{Ciphertext} \\
\hline 000 & 110 \\
\hline 001 & 001 \\
\hline 010 & 111 \\
\hline 011 & 010 \\
\hline 100 & 000 \\
\hline 101 & 011 \\
\hline 110 & 101 \\
\hline 111 & 100 \\
\hline
\end{array}$$

The following ciphertext was encrypted with the above cipher with key $\mathrm{K}$ in counter mode (with initial counter value $=0):$

$\text{C}=100110000$

What was the plaintext?
recategorized by

1 Answer

Related questions

484
views
1 answers
1 votes
admin asked Dec 15, 2022
484 views
A transposition cipher (but not a rail-fence cipher) was used to produce the following ciphertext:$\text{X 2! H M E S S S E 2 Y T A 2 I I A}$The key used was: $5 \; 2 \; 6 \; 3 \; 4 \; 1.$What was the plaintext used (in English)?
299
views
0 answers
1 votes
admin asked Dec 15, 2022
299 views
A context-free grammar is in Chomsky Normal Form if every rule is of the form\[\begin{array}{l}A \longrightarrow B C \\A \longrightarrow a\end{array}\]where ... A \longrightarrow B \mid S \\B \longrightarrow b \mid \varepsilon\end{array}\]
416
views
0 answers
1 votes
admin asked Dec 15, 2022
416 views
Suppose $\mathrm{A}$ and $\mathrm{B}$ use Diffie-Hellnian key exchange. Let the commonly agreed (i.e., global public) prime number $(q)=13$ ... shared secret key $(\mathrm{K})$ between $\mathrm{A}$ and $\mathrm{B}$
207
views
0 answers
1 votes
admin asked Dec 15, 2022
207 views
Derangements are permutations $\pi$ of the set $\{1,2, \ldots, n\}$ such that $\pi(i) \neq i.$ Compute the number of derangements on the set $1,2, \ldots, n$.