User Tools
problem:simple_shift_repetition
Differences
This shows you the differences between two versions of the page.
|
problem:simple_shift_repetition [2013/09/27 18:43] tarafife created |
problem:simple_shift_repetition [2013/09/27 18:46] (current) tarafife |
||
|---|---|---|---|
| Line 50: | Line 50: | ||
| \item If we use $\phi_5$ instead of $\phi_4$, how many commanders can we include in this encryption scheme and still tell who sent the message? | \item If we use $\phi_5$ instead of $\phi_4$, how many commanders can we include in this encryption scheme and still tell who sent the message? | ||
| \item Is there an encryption key $\phi_n$ so that $\phi_n^2=\phi_0$. In other words, is there an encryption key $\phi_n$ that will only allow up to two commands to be in the chain? | \item Is there an encryption key $\phi_n$ so that $\phi_n^2=\phi_0$. In other words, is there an encryption key $\phi_n$ that will only allow up to two commands to be in the chain? | ||
| + | \end{enumerate} | ||
| \end{problem} | \end{problem} | ||
| </ | </ | ||
problem/simple_shift_repetition.1380321785.txt.gz · Last modified: 2013/09/27 18:43 by tarafife
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
