![]() ![]() ![]() ![]() Unless I miscalculated something (a real possibility), the corresponding decryption exponent is $d=1$ I believe that satisfies your requirement as to a "trivial" operation.Īn option strictly matching the question's statement (which requires $e=65537$) is to choose the public modulus $n$ as the product of many small primes $p_i$, perhaps $k=64$ primes of $32$ bits. Actually, if you're willing to consider a somewhat larger $e$, I found a solution that makes the decryption part real cheap. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |