Ask your own question, for FREE!
Mathematics 8 Online
OpenStudy (claire.bracken):

The House of Lilliput is using RSA encryption to receive secret messages from all the realms. They have published their public encoding exponent e = 37 and their public modulus M = pq = 527. Break the code: Find their secret decoding exponent d.

ganeshie8 (ganeshie8):

Our goal here in breaking the code is to find "x" that satisfies : \[x^{37}\equiv c \pmod{527}\] where \(c\) the encrypted message

ganeshie8 (ganeshie8):

Recall euler's extension to little fermat : \[a^{\phi(n)}\equiv 1\pmod{n}\]

OpenStudy (claire.bracken):

yup @ganeshie8

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!