Timeline for Security of permutation cipher
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 17, 2014 at 19:17 | vote | accept | Thomas | ||
| Apr 16, 2014 at 22:46 | comment | added | rath | @Thomas Okay, that clears things up. I was looking for a keyed generator rather than a purely random one, but it has no bearing on your scheme. | |
| Apr 16, 2014 at 21:42 | comment | added | Thomas | @rath: I am not sure that I understand. So in a sense the key consists of $sigma_1, \dots , \sigma_n$. It is assumed that these permutations are constructed randomly first. | |
| Apr 16, 2014 at 21:12 | comment | added | fgrieu♦ | Among many weaknesses: if $i$ and $j$ are in any segment where only the first permutation changed (including at least $i<255$ and $j<255$), then $c_i=c_j\Longleftrightarrow p_i+i≡p_j+j\pmod{256}$. E.g. "FED" encodes to 3 identical bytes. | |
| Apr 16, 2014 at 20:34 | answer | added | poncho | timeline score: 3 | |
| Apr 16, 2014 at 20:24 | history | tweeted | twitter.com/#!/StackCrypto/status/456528665547788288 | ||
| Apr 16, 2014 at 19:44 | comment | added | rath | That does look a lot like Enigma. I assume the key is some generator $G(k)=\{\sigma_1, \ldots, \sigma_n\}$? | |
| Apr 16, 2014 at 19:18 | history | asked | Thomas | CC BY-SA 3.0 |