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

Header Data

From: Jim choate <ravage@bga.com>
To: sinclai@ecf.toronto.edu (SINCLAIR DOUGLAS N)
Message Hash: 10c8110c9b90ac1fcf0f8c569693164d89d1f0d4f3bdc03ea322959f6b8f973d
Message ID: <199406171531.KAA01459@zoom.bga.com>
Reply To: <94Jun17.112118edt.8280@cannon.ecf.toronto.edu>
UTC Datetime: 1994-06-17 15:32:58 UTC
Raw Date: Fri, 17 Jun 94 08:32:58 PDT

Raw message

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

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

If you (or anyone else comes across anything that even looks remotely 
interesting would appreciate knowing about it).