Cryptohack - RSA Starter 1 [10 pts]

Fri, 20 May 2022 00:00:00 +0530

The Solution is shared considering CAN I SHARE MY SOLUTIONS?

Problem

All operations in RSA involve modular exponentiation.

Modular exponentiation is an operation that is used extensively in cryptography and is normally written like: 2¹⁰ mod 17

You can think of this as raising some number to a certain power (2¹⁰ = 1024), and then taking the remainder of the division by some other number (1024 mod 17 = 4). In Python there’s a built-in operator for performing this operation: pow(base, exponent, modulus)

RSA on Aditya Telange

Cryptohack - RSA Starter 1 [10 pts]

Problem