Prime magnitude and keys...a ?
Jim choate
ravage at bga.com
Fri Jun 17 08:32:58 PDT 1994
>
> 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.
>
Exactly.
If you (or anyone else comes across anything that even looks remotely
interesting would appreciate knowing about it).
More information about the cypherpunks-legacy
mailing list