From: Anonymous <nobody@REPLAY.COM>
Date: Mon, 19 Jan 1998 17:25:45 +0800
To: cypherpunks@cyberpass.net
Subject: Re: proving that one knows how to break RSA
Message-ID: <199801190915.KAA15874@basement.replay.com>
MIME-Version: 1.0
Content-Type: text/plain



Dimitri Vulis <dlv@bwalk.dm.com> writes:
> Adam Back <aba@dcs.ex.ac.uk> writes:
> > Dimitri Vulis <dlv@bwalk.dm.com> writes:
> > > Bill Payne was with Sandia national lab (where they quite a bit of
> > > crypto work) Bill claims to have discovered a very fast
> > > factorization algorithm using shift registers, which he refuses to
> > > publish. While I haven't seen the algorithm, I believe he may well
> > > be right.
> >
> > Bill Payne's claim to having discovered a faster factorization
> > algorithm than the current state of the art, allows us to invoke the
> > oft discussed mechanisms for the author to prove this ability without
> > divulging the algorithm, and then proceed to sell the algorithm to the
> > highest bidder, whilst minimizing his chances of being killed.
> ...
> I believe Bill is genuinely afraid that if he published his algorithm,
> then he'll be killed. I don't know enough to judge how realistic his
> fear is. I've been involved in serious discussions of assassinations
> over smaller amounts of money than is at stake here. He displays great
> courage by saying anything at all at this point.

Oh, please.  Payne's so-called faster factorization algorithm was
discussed on this list May 13.  See the archives under the thread title
"Public Key Break Paper".  The algorithm is total garbage.  Payne is
obviously a nut case who is setting himself up for a contempt of court
charge.