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

Header Data

From: SINCLAIR DOUGLAS N <sinclai@ecf.toronto.edu>
To: ravage@bga.com (Jim choate)
Message Hash: 2d1da754f75bc363ebb142e2ca09b937883c4415061aa928f28e349afecc902c
Message ID: <94Jun17.112118edt.8280@cannon.ecf.toronto.edu>
Reply To: <199406171451.JAA29719@zoom.bga.com>
UTC Datetime: 1994-06-17 15:21:38 UTC
Raw Date: Fri, 17 Jun 94 08:21:38 PDT

Raw message

From: SINCLAIR  DOUGLAS N <sinclai@ecf.toronto.edu>
Date: Fri, 17 Jun 94 08:21:38 PDT
To: ravage@bga.com (Jim choate)
Subject: Re: Prime magnitude and keys...a ?
In-Reply-To: <199406171451.JAA29719@zoom.bga.com>
Message-ID: <94Jun17.112118edt.8280@cannon.ecf.toronto.edu>
MIME-Version: 1.0
Content-Type: text/plain

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

I hope not.  If such a thing existed (if I understand your description
correctly) RSA could be cracked by a binary search of keyspace.  The
search would be O(log(n)), meaning it would be directly linear with
the number of bits in the key.