join( map( lambda x: str( x), encrypted_msg)))

Print( 'Your public key is ', public, ' and your private key is ', private)Įncrypted_msg = encrypt( private, message) Print( 'Generating your public/private keypairs now. Plain = ĭetect if the script is being run directly by the user

#Generate the plaintext based on the ciphertext and key using a^b mod m #Convert each letter in the plaintext to numbers based on the character using a^b mod mĬipher = #Public key is (e, n) and private key is (d, n) #Use Extended Euclid's Algorithm to generate the private key #Use Euclid's Algorithm to verify that e and phi(n) are comprime #Choose an integer e such that e and phi(n) are coprime Raise ValueError( 'p and q cannot be equal') Return + ]ī = multiply( xlow + xhigh, ylow + yhigh) Ob = b # negative values from return results # Iterateive Version is faster and uses much less stack space # Neg return values for i or j are made positive mod b or a respectively # or j = multiplicitive inverse of b mod a # r = gcd(a,b) i = multiplicitive inverse of a mod b '''Returns a tuple (r, i, j) such that r = gcd(a, b) = ia + jb Use iteration to make it faster for larger integers Str_failure = 'Failure after' + str( r_) + 'tries.'Įuclid's algorithm for determining the greatest common divisor #randrange is mersenne twister and is completely deterministic #of composite numbers from our potential pool without resorting to Rabin-Miller

taking n modulo each lowPrime allows us to remove a huge chunk #lowPrimes is all primes (sans 2, which is covered by the bitwise and operator)

Decrypt rsa python chr