Problem 766. Implement Solitaire cipher for N long deck.

Created by Doug Hull

Solve Later

Given a starting permutation of numbers [1:N], deck, generate M values for the keystream. The small joker will be value N-1, the big joker will be N.

This is an update of this problem.

Solve

Solution Stats

39 Solutions
17 Solvers

Last Solution submitted on Jun 02, 2023

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Christian Schröder on 26 Feb 2023

I'm not sure what algorithm we're supposed to implement here, but it does not appear to be the key generation for Schneier's Solitaire cipher.

For instance, when the initial deck is 1:N for some N > 4, it will be [2:N 1] after the jokers are moved and the two cuts performed, so the first key generated will then always be 4. In the test suite, it's 3.

Also, the last test in the test suite shows that in the algorithm asked for here, the jokers are kept in the keystream, which is not the case in Schneier's original algorithm.

It would be nice if you could update the problem's description with some additional details.

Solution Comments

Show comments

Problem Recent Solvers17

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 766. Implement Solitaire cipher for N long deck.

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers17

Suggested Problems

More from this Author51

Problem Tags

Community Treasure Hunt

Problem 766. Implement Solitaire cipher for N long deck.

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers17

Suggested Problems

More from this Author51

Problem Tags

Community Treasure Hunt

Players