In general for most cryptographic systems the cryptographic keys should be as random as possible.
Shamir and van Someren [REF] demonstrated one example of this analytical approach for finding private RSA keys where the public key is known and has a small public exponent.