f



An improvement of the classical Playfair cipher

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
0
Mok
4/14/2016 8:03:29 PM
comp.security.firewalls 10672 articles. 0 followers. dfinc1988 (97) is leader. Post Follow

1 Replies
181 Views

Similar Articles

[PageSpeed] 23

Mok-Kong Shen <mok-kong.shen@t-online.de> wrote:
> 
> 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
> 

I would suggest to post such articles to sci.crypt newsgroup.

-- 
dunno
0
dunno
5/5/2016 9:02:15 AM
Reply: