| Viewing Single Post From: Another technique for identifying vowels | |
|---|---|
| jdege | Jun 7 2008, 09:14 PM |
|
Elite member
![]() ![]() ![]() ![]() ![]() ![]() ![]()
|
Thinking about this and where else it might be applied. 1. A cipher in which word separations are included, but enciphered. The most common code group is usually the word separator, but it's almost certain to have the lowest sum of the squares of the distance between them. 2. I've seen grid codes in which a pair of letters represented letters, common digrams or trigrams, numbers, or syllables, or a pair of letters represented a word, where two specific pairs of letters meant that the succeeding letters were words, or the succeeding letters were letters. In other words, where there were two "shift"codes, that changed the value of all succeeding code groups. These shifts should be distinguishable by their strict alternation. But if there were several pairs that were strictly alternating, would it be likely that the proper one would have the lowest sum of squares? |
| When cryptography is outlawed, bayl bhgynjf jvyy unir cevinpl. | |
![]() |
|
| Another technique for identifying vowels · General | |




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


11:04 AM Nov 28