1995-01-17 - Re: request for factorising code

Header Data

From: Michael Handler <grendel@netaxs.com>
To: aba@atlas.ex.ac.uk
Message Hash: 6485a232ea02a5c2fc94cf80f418eb54bb077afa3ca69e06c27108cfec1a52f1
Message ID: <Pine.SUN.3.91.950116194240.21082A-100000@unix3.netaxs.com>
Reply To: <6482.9501161922@exe.dcs.exeter.ac.uk>
UTC Datetime: 1995-01-17 00:48:08 UTC
Raw Date: Mon, 16 Jan 95 16:48:08 PST

Raw message

From: Michael Handler <grendel@netaxs.com>
Date: Mon, 16 Jan 95 16:48:08 PST
To: aba@atlas.ex.ac.uk
Subject: Re: request for factorising code
In-Reply-To: <6482.9501161922@exe.dcs.exeter.ac.uk>
Message-ID: <Pine.SUN.3.91.950116194240.21082A-100000@unix3.netaxs.com>
MIME-Version: 1.0
Content-Type: text/plain

On Mon, 16 Jan 1995 aba@atlas.ex.ac.uk wrote:

> I have code to generate the RSA key pairs and modulus, what I am
> looking for is code to factorise a number using one of the better
> algorithms (quadratic sieve, etc.).

	It's been established that the encryption in Netscape is 40 bit 
RC4, not 40 bit RSA, but if anyone's still looking for the quadratic 
sieve code, look on Derek Atkins' ftp site toxicwaste.mit.edu. Arjen 
Lenstra may have made the large number field sieve (LNFS) code available 
somewhere, but I'm not sure.

Michael Handler                                         <grendel@netaxs.com>
Civil Liberty Through Complex Mathematics                   Philadelphia, PA
PGP Key ID FC031321  Print: 9B DB 9A B0 1B 0D 56 DA  61 6A 57 AD B2 4C 7B AF
"Toi qui fais au proscrit ce regard calme et haut" -- Baudelaire * Skotoseme