# -*- encoding:gbk -*- import math,random#導入模塊 def prime_num(max_num):#生成小于max_num的素數列表 prime_num=[] for i in xrange(2,max_num): temp=0 sqrt_max_num=int(math.sqrt(i))+1 for j in xrange(2,sqrt_max_num): if i%j==0: temp=j break if temp==0: prime_num.append(i) return prime_num def rsa_key():#生成密鑰的函數 prime=prime_num(400)#小于400的素數列表 p=random.choice(prime[-50:-1])#從后50個素數中隨機選擇一個作為p q=random.choice(prime[-50:-1])#從后50個素數中隨機選擇一個作為q while(p==q):#如果p和q相等則重新選擇 q=random.choice(prime[-50:-1]) N=p*q r=(p-1)*(q-1) r_prime=prime_num(r) e=random.choice(r_prime)#隨機選一個素數 d=0 for n in xrange(2,r): if (e*n)%r==1: d=n break return ((N,e),(N,d)) def encrypt(pub_key,origal):#生成加密用的公鑰 N,e=pub_key return (origal**e)%N def decrypt(pri_key,encry):#生成解密用的私鑰 N,d=pri_key return (encry**d)%N

#!/usr/bin/env python#encoding=utf-8 '''測試rsa加密解密'''from M2Crypto import RSA msg = 'aaaa-aaaa'rsa_pub = RSA.load_pub_key('rsa_pub.pem')rsa_pri = RSA.load_key('rsa_pri.pem')print '*************************************************************'print '公鑰加密，私鑰解密'ctxt = rsa_pub.public_encrypt(msg, RSA.pkcs1_padding)ctxt64 = ctxt.encode('base64')print ('密文:%s'% ctxt64)rsa_pri = RSA.load_key('rsa_pri.pem')txt = rsa_pri.private_decrypt(ctxt, RSA.pkcs1_padding)print('明文:%s'% txt)print '*************************************************************'print '私鑰加密，公鑰解密'ctxt_pri = rsa_pri.private_encrypt(msg, RSA.pkcs1_padding)ctxt64_pri = ctxt.encode('base64')print ('密文:%s'% ctxt64_pri)txt_pri = rsa_pub.public_decrypt(ctxt_pri, RSA.pkcs1_padding)print('明文:%s'% txt_pri)