This is because in RSA, for any $m$ in range, $(m^e)^d \equiv (m^d)^e \equiv m \pmod n$. Taking a number to power d (modulo n) is the inverse operation to taking a number to power e.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |