With start=10000000000000000 or a sufficiently large number, both encryptmessage and decryptmessage becomes a large number. Add a description, image, and links to the rsa-decryption topic page so that developers can more easily learn about it. fastpower.fast_power is exponentiation with modulus. Here, the external function names suggest their usage e.g.
keys=NoneĮncryptmessage=fastpower.fast_power(101,keys,keys)ĭecryptmessage=fastpower.fast_power(encryptmessage,keys,keys) I created e and d, and this is the encryption. I checked those to make sure they are prime. I have created valid primes digest1 and digest2. I have tested the external modules for lcm, gcd, exponents by squaring with exponents, modular multiplicative inverse, and primality test.
I am trying to create my own function for RSA encryption, but the results are not what I want.
