Sorry for the delay, this ticket slipped through the net, and Nils
Larsch recently brought it to my attention.
Vadim Fedukovich wrote:
[snip]
I'm particular interested exactly why it is believed that
gcd(p-1,e)==1 and gcd(q-1,e)==1 (according to comments
in the source).
[snip]
The gcd()
Hello,
I'm interested in views/comments on RSA keys generation.
Namely, testing whether (p-1)(q-1) is relatively prime to e.
It seems both p and q generated are not strong primes
so there might be (a slim) chance for e to divide p-1 or q-1.
However, this check (together with changing e) is
