RSA on Aditya Telangehttps://adityatelange.in/writeups/cryptohack/rsa/Recent content in RSA on Aditya TelangeAditya Telangehttps://adityatelange.in/assets/tn.jpghttps://adityatelange.in/assets/tn.jpgHugo -- 0.122.0en2020 - 2024 Aditya TelangeFri, 20 May 2022 00:00:00 +0530Cryptohack - RSA Starter 1 [10 pts]https://adityatelange.in/writeups/cryptohack/rsa/rsa-starter-1/Fri, 20 May 2022 00:00:00 +0530https://adityatelange.in/writeups/cryptohack/rsa/rsa-starter-1/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: 210 mod 17
You can think of this as raising some number to a certain power (210 = 1024), and then taking the remainder of the division by some other number (1024 mod 17 = 4).