From: utzoo!decvax!harpo!eagle!mhtsa!alice!npoiv!npois!hou5f!ariel!houti!hogpc!houca!kdh
Newsgroups: net.crypt
Title: Re: Digram statistics question
Article-I.D.: houca.132
Posted: Thu May 12 14:00:49 1983
Received: Thu May 19 03:02:59 1983


One possible attack for this problem would be to compile stats on

"Given this letter, what letter most frequently follows it?"

This would have the desired effect with "QU", since a "U" follows a "Q"
in almost all cases.  Given the columns:

	M N Y A E T E 

the operation would then consist of "which letter will probably follow the M"
type decisions, rather than "which pair is most common".
Other than that, the algorithm would probably be very similar.

					Kevin Hunter
					American Bell
					houca!kdh