python 实现aes256 rsa 混合加解密（改进）

声明：本代码可能会删除（或改写）某些文件（或文件夹），请小心。但删除的文件（或文件夹）一定在存放代码的py文件的同目录下。本代码需要安装python的库。所以，如果报错，可以尝试安装一下python库。需要在同目录创建 联系人+'(加密).txt'文件和需要加密的文件（此文件不会被删或改下）（加密的话）联系人+'(加密).txt'的格式为：

n(对方的n)

e(对方的e)

n(自己的n)

d(自己的d)

如果解密的话创建 联系人+'(解密).txt' 格式为

n(自己的n)

d(自己的d)

n(对方的n)

e(对方的e)

注：4500>n的位数（十进制）(双方的n的最小值)>5000(加密文字)

200>n的位数（十进制）(双方的n最小值)>5000(加密文件)

此说明可能不是很详细，看不懂的话可以自己看代码

编译器使用python3.11.0或以上的都可以，如果python3.11.0以下的话可以以试一试能不能运行。如果sys.set_int_max_str_digits(5000)报错，就把这行删了（程序中出现的都删了）

加密代码：
老版链接：https://blog.csdn.net/weixin_73092756/article/details/130039225

新版链接：(45条消息) python 实现aes256 rsa 混合加解密（改进2）_陆明295的博客-CSDN博客

import random
import sys
import time
import pyperclip
import struct
import os
import py7zr
from Crypto.Cipher import AES
import   zipfile
import operator
import base64
def make_zip(source_dir, output_filename):
    zipf = zipfile.ZipFile(output_filename, 'w')    
    pre_len = len(os.path.dirname(source_dir))
    for parent, dirnames, filenames in os.walk(source_dir):
        for filename in filenames:
            pathfile = os.path.join(parent, filename)
            arcname = pathfile[pre_len:].strip(os.path.sep)     #相对路径
            zipf.write(pathfile, arcname)
    zipf.close()
def xc(month_rank_dir):
 make_zip(month_rank_dir,month_rank_dir+'.7z')
 
def base36_encode(number):
    num_str = '0123456789abcdefghijklmnopqrstuvwxyz'
    if number == 0:
        return '0'

    base36 = []
    while number != 0:
        number, i = divmod(number, 36)    # 返回 number// 36 , number%36
        base36.append(num_str[i])
    return ''.join(reversed(base36))
a=[]
bj=[]
AES_BLOCK_SIZE = AES.block_size  # AES 加密数据块大小, 只能是16
AES_KEY_SIZE = 32
key=''
for i in range(32):
    v=random.randint(0,255)
    bn=v
    v=hex(v)
    v=v[2:]
    if(len(v)==1):
        v='0'+v
    key=key+v
    a.append(bn)

iv=''
for i in range(16):
    v=random.randint(0,255)
    bn=v
    v=hex(v)
    v=v[2:]
    if(len(v)==1):
        v='0'+v
    iv=iv+v
    bj.append(bn)
    
#加密内容需要可以被16整除，所以进行空格拼接



def PKCS_zero(text):
    newbytes = [0]
    if len(text) % 32:
        add = 32 - (len(text) % 32)
        
    else:
        add = 0
    text = text + bytearray(newbytes * add)
    return text
    
# 加密函数
def vio(key,iv,text):
    print("AES_CBC_encrypt")
    print(" key  :", key, type(key))
    print(" iv   :", iv, type(iv))
    #print("plain :", text, type(text))

    mode = AES.MODE_CBC
    text = PKCS_zero(text)
    #text = bytes.fromhex(text)
    #print("plain :", bytes.hex(text),type(text))
    key = bytes.fromhex(key)
    iv = bytes.fromhex(iv)

    cryptos = AES.new(key, mode, iv)
    cipher_text = bytes.hex(cryptos.encrypt(text))
    # 因为AES加密后的字符串不一定是ascii字符集的，输出保存可能存在问题，所以这里转为16进制字符串

    #print("cipher:", cipher_text, type(cipher_text))
    print("************************************************")
    return cipher_text
    
    


    
def hx (p):
    global key
    global iv
    

    f=open(p,'rb')
    size = os.path.getsize(p)
    cpp=f.read()
    
    po=vio(key,iv,cpp)
    return po

def oo():
 sys.set_int_max_str_digits(5000)
 ooo=input('请输入联系人:')
 ccc=ooo+"(加密).txt"
 ff=open(ccc)
 print("请输入要加密的数据:",end='')
 o=input('')
 df = pyperclip.paste()
 while 1:
    test = "哦74人工会3非用246骨灰级の|}{54657326482356765432792以698398i天弘基金ijijihi急急急ii几句hi基金i户籍ijiu及hi就ihi ihi就ihiiji及hi九九iji及uu948958959949958怕怕’、！@#%……&……%￥￥￥###￥##看看风景给；提开发开放吗看见没iffjgokigfuhiojsok34596789ij8igidki;f;.,l.;f,gl.l"
    pyperclip.copy(test)
    io=input('')
    if(io=='哦74人工会3非用246骨灰级の|}{54657326482356765432792以698398i天弘基金ijijihi急急急ii几句hi基金i户籍ijiu及hi就ihi ihi就ihiiji及hi九九iji及uu948958959949958怕怕’、！@#%……&……%￥￥￥###￥##看看风景给；提开发开放吗看见没iffjgokigfuhiojsok34596789ij8igidki;f;.,l.;f,gl.l'):
        break
    o+='''
'''
    o+=io
 print("输入完成")
 pyperclip.copy(df)

 mmm=time.time()
 n1=ff.readline()
 n1=int(n1)
 e=ff.readline()
 e=int(e)
 n2=ff.readline()
 n2=int(n2)
 d=ff.readline()
 d=int(d)
 m=20000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000