cryptoanarchy.wiki

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

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

Header Data

From: “Perry E. Metzger” <perry@imsi.com>
To: Jim choate <ravage@bga.com>
Message Hash: 23e8b9dc0c1dbd1852fb94694705dfbdd746e1839c91aff5d34f10b09a48a508
Message ID: <9406171610.AA02349@snark.imsi.com>
Reply To: <199406171451.JAA29719@zoom.bga.com>
UTC Datetime: 1994-06-17 16:11:07 UTC
Raw Date: Fri, 17 Jun 94 09:11:07 PDT

Raw message

From: "Perry E. Metzger" <perry@imsi.com>
Date: Fri, 17 Jun 94 09:11:07 PDT
To: Jim choate <ravage@bga.com>
Subject: Re: Prime magnitude and keys...a ?
In-Reply-To: <199406171451.JAA29719@zoom.bga.com>
Message-ID: <9406171610.AA02349@snark.imsi.com>
MIME-Version: 1.0
Content-Type: text/plain



Jim choate says:
> I was wondering if anyone is aware of a function or test which would allow
> a person to feed PGP or other RSA algorithm a test key and then look at
> the result and determine if the key was greater or lesser than the 
> actual key? 

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

Thread