cryptoanarchy.wiki

Arise, you have nothing to lose but your barbed wire fences!

1998-01-19 - Re: proving that one knows how to break RSA

Header Data

From: “Vladimir Z. Nuri” <vznuri@netcom.com>
To: Adam Back <aba@dcs.ex.ac.uk>
Message Hash: 43f78dace6b88112e9260faeecbd23062d916f7950540525f81a7157d26916ff
Message ID: <199801190434.UAA20448@netcom16.netcom.com>
Reply To: <199801182343.XAA00268@server.eternity.org>
UTC Datetime: 1998-01-19 04:42:16 UTC
Raw Date: Mon, 19 Jan 1998 12:42:16 +0800

Raw message

From: "Vladimir Z. Nuri" <vznuri@netcom.com>
Date: Mon, 19 Jan 1998 12:42:16 +0800
To: Adam Back <aba@dcs.ex.ac.uk>
Subject: Re: proving that one knows how to break RSA
In-Reply-To: <199801182343.XAA00268@server.eternity.org>
Message-ID: <199801190434.UAA20448@netcom16.netcom.com>
MIME-Version: 1.0
Content-Type: text/plain



>
>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.

I think this ought to be nipped in the bud right now if not true.
I've heard rumors on this list about algorithms but attributing it to
someone at Sandia is pretty substantial however I think DV's claim
above sounds totally bogus. if anyone else can comment please do.
I don't so much want to know whether he has discovered an algorithm
at this point, only whether someone at Sandia claims to have
discovered a fast factoring algorithm. after that-- well, what
exactly is "fast"?

Thread