Re: Re: VMs: Gordon Rugg in Scientific American

["Jeff" <jeff@xxxxxxxxxxxxxxxxxxxxxx>]

What would be better would be to work on Jon (without the h) Grove's vms
text generator algorithm. With his permission, of course. In it's last known
form it mimmicked the vms text quite well. That would be a better challenge
to Gordon's claims.

What do you think Jon?

Jeff


----- Original Message -----
From: "Jan" <hurychj@xxxxxxxxx>
To: <vms-list@xxxxxxxxxxx>
Sent: 28 June 2004 18:00
Subject: Re: Re: VMs: Gordon Rugg in Scientific American


> Hello Nick,
>
> well, it looks like Gordon Rugg has thrown some challenge in our face -
why don't we return it
> back? Imagine publishing  10 different texts encrypted each by DIFFERENT
Cardan grille, the
> original texts being in the same language, but only one of them being a
fraud (I do not exactly
> understand what he means by fraud:  the "non-sensical original" or
something worse? :-).  If he
> can determine which text it  is, he certainly can make a point.
>
> No I am not expert on Cardan grille  - so  it may  be still easy for him,
but to make  it more
> complicated, we may use different language for each text or combination of
two grills and what not. Or we may even try to simulate the VM structure.
This e-mail conference may chose a group of experts for the job and the
posting of challenge  should be done in some well known publication. Do you
think he will be a game?
>
> Jan
>


______________________________________________________________________
To unsubscribe, send mail to majordomo@xxxxxxxxxxx with a body saying:
unsubscribe vms-list