| Welcome to Crypto. We hope you enjoy your visit. You're currently viewing our forum as a guest. This means you are limited to certain areas of the board and there are some features you can't use. If you join our community, you'll be able to access member-only sections, and use many member-only features such as customizing your profile, sending personal messages, and voting in polls. Registration is simple, fast, and completely free. Join our community! If you're already a member please log in to your account to access all of our features: |
| Counting Letter Contacts; Using a contact chart | |
|---|---|
| Topic Started: Oct 11 2005, 01:19 PM (378 Views) | |
| rot13 | Oct 11 2005, 01:19 PM Post #1 |
|
Elite member
![]() ![]() ![]() ![]() ![]() ![]() ![]()
|
I don't know if anyone else has taken a look at Challenge 2 at http://www.cipher.maths.soton.ac.uk (the site mentioned by our new member, cows. The second part of the challenge is morse code that breaks down into a substitution cipher without word breaks. One of the things I occasionally find handy with these types of cryptograms is to count the frequency of contacts between letters. How often does X precede G? How often does it follow it? Here is a chart for the 10 most frequent letters, generated by the python program I use for simple substitutions:
One of the first things I always look for is the pattern you see here with I-C-H. I is fairly frequent, C is a good bit less frequent, and H is the most frequent. The pattern, you see that I is the letter that most often precedes C, and H is the letter that most often follows it. This pattern usually points towards THE. The next interesting one, which shows up more often in longer cryptograms than in short ones is that U follows H more than any other letter, and comes before H more than any other letter except C. ER and RE are two very common digraphs, so the fact that UH and HU occur so frequently, it is a good guess that U is R. Also, notice that H, Z and F tend to contact more letters than the others. This suggests that they are vowels. Noticing that S comes after H, Z and F fairly often, I might conclude that it is a consonant, and that might also suggest that J is also a vowel. Since I aready have a guess for what represents T, I might guess that S represents N. |
![]() |
|
| insecure | Oct 11 2005, 02:21 PM Post #2 |
|
Elite member
![]() ![]() ![]() ![]() ![]() ![]() ![]()
|
As rot13 rightly points out, digraphs (and trigraphs, and tetragraphs, and ...) are extremely useful indicators in monoalphabetic substitution ciphers. Not only that, but they can also be handy in recognisers - that is, in modules whose task is to determine whether a given attempt at a key has resulted in a readable plaintext. |
![]() |
|
| Donald | Oct 11 2005, 03:03 PM Post #3 |
|
Elite member
![]() ![]() ![]() ![]() ![]() ![]() ![]()
|
I've been trying to learn the "consonant-line short cut" as explained in Helen Fouche Gaines "Cryptanalysis". You can do some REALLY cool things with contact information. Gaines's book is not exactly user friendly, but it IS full of useful techniques. Donald |
![]() |
|
| rot13 | Oct 11 2005, 03:35 PM Post #4 |
|
Elite member
![]() ![]() ![]() ![]() ![]() ![]() ![]()
|
Now that you mention it, I think I need to go back and re-read that book. It has been a while and when I first read it, a lot of the techniques were new to me, so I probably missed a lot of the subtle tricks. |
![]() |
|
| 1 user reading this topic (1 Guest and 0 Anonymous) | |
| « Previous Topic · General · Next Topic » |





![]](http://209.85.122.85/static/1/pip_r.png)



7:51 PM Nov 27