Schneier’s solitaire cipher
In some ways, this is a lot like a pseudo-random number generator: The values are only random to the uninitiated. In this series, we will implement the algorithm, and analyze the output of the algorithm.
The algorithm will rearrange the cards. Since for a six card problem, there are 720 states for the cards to be in we can say for certainty that after 721 iterations, we will have repeated a state. The question is does it take that long, or are their smaller loops? How many loops or cycles are there?
Here is the Cody problem, so watch the video to see the algorithm and try to implement it.
- カテゴリ:
- Format: Video
コメント
コメントを残すには、ここ をクリックして MathWorks アカウントにサインインするか新しい MathWorks アカウントを作成します。