1994-06-17 - Re: Prime magnitude and keys…a ?

Header Data

From: Jim choate <ravage@bga.com>
To: perry@imsi.com
Message Hash: 3b99efc4ab8e9c6535644045e4563db54ed58f85c25a01b05ff656adc7606ef5
Message ID: <199406171633.LAA04621@zoom.bga.com>
Reply To: <9406171610.AA02349@snark.imsi.com>
UTC Datetime: 1994-06-17 16:33:43 UTC
Raw Date: Fri, 17 Jun 94 09:33:43 PDT

Raw message

From: Jim choate <ravage@bga.com>
Date: Fri, 17 Jun 94 09:33:43 PDT
To: perry@imsi.com
Subject: Re: Prime magnitude and keys...a ?
In-Reply-To: <9406171610.AA02349@snark.imsi.com>
Message-ID: <199406171633.LAA04621@zoom.bga.com>
MIME-Version: 1.0
Content-Type: text

> Of course you haven't seen such a thing. If factoring RSA keys
> requires exponential time, such an algorithm is obviously not
> possible. Were it possible, you could factor in time proportional to
> the the number of bits in the key. Anyone who had such a function
> would either be famous or wouldn't be talking.
> Perry
How about some evidence on it? I see no reason to compare taking a key
and determining if it is too large or too small as being necessarily
equivalent to factoring a large number. I do not need to know the number
exactly to determine its relative magnitude. 

NSA doesn't say much...

I have found no evidence so far in my search for such a methodoligy, as a 
matter of fact I have found no evidence that anyone has ever even looked
at such a scheme. If you know something I haven't been able to find then
pleas enlighten me so I can move on to other more worthy things to play

Thanks for the feedback...