Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It only takes a minute to sign up.
Sign up to join this community
This question already has an answer here:
I've been wondering about the 'small' part of the attacks on RSA, like the small public key exponent and the small private key exponent and what's not really clear is how small are we talking about? Like is it how small with respect to the large prime numbers or what exactly?
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
Exponentiation by squaring takes time approximately proportional to the number of bits in the exponent. 3 has been used but allows attacks on some weak padding schemes. 65537 ($=2^{16}+1$) is the one used widely in practice.
