# Tag Info

Accepted

### Validating an RSA public key

Given a pair of integers $(n,e)$, we can quickly decide that it is not a valid RSA key (mathematically, or in the sense of conforming to the de-facto standard PKCS#1, or in the sense of providing ...
• 126k

### Validating an RSA public key

Well, for $e$, you can certainly test if $e$ is an odd number greater than 1; any such $e$ is a possible public exponent, and and it is infeasible to determine if $\gcd( e, \phi(n)) > 1$, and so ...
• 134k

### Why RSA uses {d,n} as private key instead of {e,n}?

Note: This answer was written for the question "In RSA, are $e$ and $d$ technically equivalent?", that was migrated from security-SE, then merged here. The relevant parts of that other ...
• 126k
Accepted

• 126k
1 vote

### Finding d of RSA given e and phi using SageMath

This is about the XGCD implementation of Sagemath. XGCD(a, b) Return a triple (g,s,t) such that g=s⋅a+t⋅b=gcd(a,b). g, s, t - such that g=s⋅a+t⋅b Note There is no guarantee that the returned ...
• 44.3k

Only top scored, non community-wiki answers of a minimum length are eligible