So I want to ask is there any rules for choosing the two primes that's used to generate
n in RSA? I mean clearly you can't choose 2 and another super big number, so I want to ask is there any restrictions like those two primes must
>=2^(key_length-2) or something like that? (Supposing RSA is also using the first but to identify positive/negative.)
Also is there a restriction that requires
n be bigger than a number, or otherwise you can also fill 0s at the beginning of a number and let it matches the bit length.
Or is there anything that though isn't consider as restrictions, but are recommended and been used in most situations?