Timeline for Is there a name for this 'enhanced' caeser shift and if so, is it trivial to break?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 21, 2013 at 4:03 | history | edited | e-sushi | CC BY-SA 3.0 |
Fixed quote formatting.
|
| Dec 6, 2013 at 10:12 | answer | added | Gustav Bertram | timeline score: 4 | |
| Nov 4, 2013 at 6:51 | history | tweeted | twitter.com/#!/StackCrypto/status/397254827841163264 | ||
| Nov 4, 2013 at 4:49 | history | edited | e-sushi |
Added "classical cipher" tag.
|
|
| Nov 4, 2013 at 4:45 | comment | added | mkg | Sure. So if the plaintext was "abc" and the code was 01 01 then first two digits would apply a caeser shift "abc"->"bcd". But the second pair of digits say to increment each shift by one more than the previous. So the actual shift would be "abc"->"bdf". | |
| Nov 4, 2013 at 4:36 | answer | added | e-sushi | timeline score: 1 | |
| Nov 4, 2013 at 4:15 | comment | added | Reid | Can you give a quick example? I may just be tired, but for some reason I am not following the description. ... As an aside, I would expect something to do with letter shifting to be quite vulnerable; usually complex shifting schemes can be viewed (ultimately) as polyalphabetic/homophonic/polygraphic substitution ciphers (depending on the cipher in question), and there's a great deal of literature on breaking such schemes. Of course, this is just a general aside and may not necessarily apply here. | |
| Nov 4, 2013 at 4:13 | review | First posts | |||
| Nov 4, 2013 at 4:27 | |||||
| Nov 4, 2013 at 3:55 | history | asked | mkg | CC BY-SA 3.0 |