#RSA Cryptography

21 messages · Page 1 of 1 (latest)

slim fern
#

You have received the message "LEFIZ" which is encrypted with the public key (N, c) = (11,882,027, 22,627) using RSA cryptography. Decrypt the message into a letter using the decryption key n = 11,863,800 and the following conversion table: A=0, B=1, C=2..., Z=25.

fringe thicket
#

Should it be gcgfgd by any chance?

#

Haven't done RSA in a while

slim fern
#

You think ?

#

did you do 1145825^11863800 (mod 11882027)?

#

or should I split the number in equal parts?

fringe thicket
#

You want to decrypt right?

slim fern
#

yeah

#

so I'm using the decryption key

fringe thicket
#

You then want to solve for

exponent*x congruent 1 mod decryption

I think

#

Where x is the thing you're solving for

slim fern
#

ok, I'll give it a try

#

thanks!

fringe thicket
#

No worries. Googling inverse mod calculator should help with that

slim fern
#

ok thx

fringe thicket
#

To be clear though. I'm not entirely sure since it's been a while. I would confirm through other ways if possible

slim fern
#

it's ok, i'll try

#

so when I try to calculate, it gives me 1129 ≡ 1145825^-1 (mod 11863)

#

but when I try to decrypt it, it gives me smth like "LCJ" which doesn't make any sense

fringe thicket
#

Let me try on paper and perhaps relearn it a bit 😂

slim fern
#

ok