Re: Prime magnitude and keys...a ?

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