Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
sdevlin
on Feb 7, 2016
|
parent
|
context
|
favorite
| on:
Ask HN: Should an RSA public exponent be prime?
I think e needs to be coprime with phi(N) rather than N itself. This is so you can find d = e^-1 mod phi(N), which would otherwise not exist.
Of course, if e shares a factor with N, you have bigger problems.
tptacek
on Feb 7, 2016
[–]
Oh, duh. Of course. :)
Consider applying for YC's Winter 2027 batch!
Applications
are open till November 2.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Of course, if e shares a factor with N, you have bigger problems.