RSA interactive shell | Python Fiddle

import math
import random

def is_prime(n):
	for i in range(2,math.ceil(math.sqrt(n))):
		if n%i == 0:
			return False
	return True
	
def next_prime(n):
	i = n
	if n%2 == 0:
		i = n+1
	while 1:
		if is_prime(i):
			return i
		i += 2
	
def pgcd(a,b):
	while b!=0:
		a,b = b, a%b
	return a

def generer_exposant(phi):
	e = 3
	while 1:
		if pgcd(e, phi)==1:
			return e
		e += 1
		
def inverse(a, b):
	(r, u, v, r2, u2, v2) = (a, 1, 0, b, 0, 1)
	while r2 != 0:
		q = r//r2
		(r, u, v, r2, u2, v2) = (r2, u2, v2, r - q *r2, u - q*u2, v - q*v2)
	return u
		
	
def genererCle():
	p = next_prime(random.randint(200, 50000))
	q = next_prime(random.randint(200, 50000))
	while q == p:
		q = next_prime(random.randint(200, 50000))
	n = p*q 
	phi = (p-1)*(q-1)
	print("Phi :")
	print(phi)
	e = generer_exposant(phi)
	d = inverse(e, phi)
	while d<0:
		d+=phi
	
	return ((n, e), (n, d))

def expmod(a,b,m):
	result = 1
	while b > 0:
		if b%2 == 1:
			result = (result*a)%m
			b -=1
		b = b//2
		a = (a*a)%m
	return result

def crypter(m, p):
	n,e = p
	return expmod(m,e,n)
	
def decrypter(c, p):
	n,d=p
	return expmod(c, d, n)

publique, privee = genererCle()
print("Cle publique : ")
print(publique)
print("Cle privee : ")
print(privee)
print("Message")
message = input("Entrez un message")
print(message)
code = crypter(message, publique)
print("Code")
print(code)
print("Message decode")
print(decrypter(code, privee))

Browser Version Not Supported

Due to Python Fiddle's reliance on advanced JavaScript techniques, older browsers might have problems running it correctly. Please download the latest version of your favourite browser.
Chrome 10+ Firefox 4+ Safari 5+
IE 10+

Let me try anyway!

Python Fiddle

Python Cloud IDE