New(?) encryption algorithm

[Michael McClary]

In article <100295 at linus.UUCP> hal at gateway.mitre.org (Hal Feinstein) asks
the "correct" way to count bigrams:
 - Each odd character, followed by its successor.
 - Each character, followed by its successor.

If what you're looking for is bigram frequency, to check for caeser
cypers and the like, the second is the way to go.  Consider that the
first approach will miss every instance of "th" that starts on an
even-numbered position.

In cyphers where each character is treated separately and similarly,
you can expect the two methods to produce similar results, but the
first to require twice as much cyphertext to give you an equivalent
amount of information.

If the cypher is chunking the data (with an even number of characters
per chunk), or otherwise treating odd and even cyphertext characters
differently, the first method might give you more useful information.