My difficulty with the material: In 2.4, about substitution ciphers, there is a lot of (slightly boring) frequency analysis. It seems rather similar to the breaking of the code in the first day of class. I think it is interesting, however, that they talk about digrams (pairs of letters) and their frequency as well.
Reflective: I was trying to come up with some way of codifying a subset of the substitution ciphers (for this group project due today), but couldn't come up with anything past caesar shifts. Having read the section about affine ciphers would've been helpful. Ah well.
However, there has to be more ways to represent subsets of the 26! substitutions. However, they will all break in the same way due to frequency analysis.
No comments:
Post a Comment