RSA’s Reliability
In principle 2 total 6 number appear1
2
3
4
5
6p 53
q 271
n 14363
φ(n) 14040
e 97
d 9553
Public key use 2 of them, n
and e
.
The rest of them do not public. The most important number above
is d
, because n
and d
compose to private key.
Discuss
How to compute d
, only know n
and e
$ed \equiv 1 \quad (mod \quad \phi(n))$
Only knowe
and than know whatd
is,
among them,e
is public.$\phi(n) = (p-1) \times (q-1)$
Need know whatp
andq
is.$n = p \times q$
Onlyn
factorization, than got whatp
q
probaly is.
Conclusion: If number n could be factorization, thand
[mod inverse element] could be found.
That mean private key be hacked.
Think
Extremely large number’s mod inverse element possible is extremely large as well. The difficulty in factorizing two coprime number that the mod inverse element possible number mod by public key e
rest got 1
, the more difficulty it is, the more security key is.
Human’s power only solve number factorization max to 232 in decimal, 768 in binary.
So at present, 768 bits[96 bytes] is the longest RSA key length be breaked.
1 | 12301866845301177551304949 |