Since the encryption code is not quite RSA you have to write your own decrypt function, which should look like this: def ext_rsa_decrypt(p, q, e, msg): Now you can factorize the modulus with msieve or search for it within the database. This should output something like Exponent: () Finding the modulus and exponent is an easy one liner with openssl: $ openssl rsa -in -pubin -text -modulus
First you have to reconstruct the prime numbers used in key generation. G.write(ext_rsa_encrypt(p, q, e, message))Īs pointed out in the comments 256 keys are quite small and can be factorized easily. Pubkey = RSA.construct((long(n), long(e))) I tried to import the public key and then decrypt but I think I have to figure out the private key in order to decrypt the message. I faced this challenge where I asked to decrypt an encrypted message using the exported public key.
0 kommentar(er)
