Though simultaneously using four 4*8 Playfair matrices and three
processing rounds of overlapping pairs of characters, it has been shown
with Maurer's Universal Statistical Test that the encryption of a
plaintext in natural language leads to a highly satisfactory result in
respect of randomness.
See
http://s13.zetaboards.com/Crypto/topic/7519154/1/
M. K. Shwn
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)