Problem 1467. Key Generation for Solitaire Cipher

Created by Nicholas Howe

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The Solitaire Cipher by Bruce Schneier was introduced to Cody in two problems by Doug Hull: </w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/753-solitaire-cipher\"><w:r><w:t>http://www.mathworks.com/matlabcentral/cody/problems/753-solitaire-cipher</w:t></w:r></w:hyperlink><w:r><w:t> and</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/766-implement-solitaire-cipher-for-n-long-deck\"><w:r><w:t>http://www.mathworks.com/matlabcentral/cody/problems/766-implement-solitaire-cipher-for-n-long-deck</w:t></w:r></w:hyperlink><w:r><w:t>.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>However, these problems do not address the initial configuration of the deck. One simple approach uses a key phrase, as described here: </w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://programmingpraxis.com/2011/01/18/solitaire-cipher/\"><w:r><w:t>http://programmingpraxis.com/2011/01/18/solitaire-cipher/</w:t></w:r></w:hyperlink></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Your job is to implement this key generator. Begin with the cards in numeric order (1:28) and process the deck once. (To \"process\" the deck you should carry out all the steps necessary to produce one character in the keystream with the regular Solitaire cipher, but you don't emit any output.) Now for each character k in the key, cut the deck by moving k cards from the front to the back of the deck. After each cut, process the deck once again. Assume that any non-alphabetic characters in the keyphrase generate a null cut (move zero characters from front to back).</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>At the end, you should return the state of the deck.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

The Solitaire Cipher by Bruce Schneier was introduced to Cody in two problems by Doug Hull: <a href = "http://www.mathworks.com/matlabcentral/cody/problems/753-solitaire-cipher">http://www.mathworks.com/matlabcentral/cody/problems/753-solitaire-cipher</a> and <a href = "http://www.mathworks.com/matlabcentral/cody/problems/766-implement-solitaire-cipher-for-n-long-deck">http://www.mathworks.com/matlabcentral/cody/problems/766-implement-solitaire-cipher-for-n-long-deck</a>.However, these problems do not address the initial configuration of the deck. One simple approach uses a key phrase, as described here: <a href = "http://programmingpraxis.com/2011/01/18/solitaire-cipher/">http://programmingpraxis.com/2011/01/18/solitaire-cipher/</a>Your job is to implement this key generator. Begin with the cards in numeric order (1:28) and process the deck once. (To "process" the deck you should carry out all the steps necessary to produce one character in the keystream with the regular Solitaire cipher, but you don't emit any output.) Now for each character k in the key, cut the deck by moving k cards from the front to the back of the deck. After each cut, process the deck once again. Assume that any non-alphabetic characters in the keyphrase generate a null cut (move zero characters from front to back).At the end, you should return the state of the deck.

Solve

Solution Stats

6 Solutions
4 Solvers

Last Solution submitted on Jun 01, 2019

Last 200 Solutions

Problem Recent Solvers4

Problem Tags

encryption solitaire cipher

Problem 1467. Key Generation for Solitaire Cipher

Solution Stats

Last 200 Solutions

Problem Recent Solvers4

Suggested Problems

More from this Author11

Problem Tags

Problem 1467. Key Generation for Solitaire Cipher

Solution Stats

Last 200 Solutions

Problem Recent Solvers4

Suggested Problems

More from this Author11

Problem Tags

Players