微信 MMTLS 协议详解(五):加密实现

news/2025/3/22 8:29:20/

常用的解密算法,对称非对称 加密,密钥协商, 带消息认证的加解密
#生成RSA 密钥对

void GenerateRsaKeypair(std::string& public_key,std::string& private_key)
{RSA* rsa = RSA_new();BIGNUM* bn = BN_new();// 生成 RSA 密钥对BN_set_word(bn, RSA_F4);RSA_generate_key_ex(rsa, 2048, bn, nullptr);// 创建内存 BIO 用于存储密钥BIO* bio_private = BIO_new(BIO_s_mem());BIO* bio_public = BIO_new(BIO_s_mem());// 将私钥写入 BIO(PKCS#8 格式)PEM_write_bio_RSAPrivateKey(bio_private, rsa, nullptr, nullptr, 0, nullptr,nullptr);// 将公钥写入 BIO(X.509 格式)PEM_write_bio_RSAPublicKey(bio_public, rsa);// 从 BIO 提取字符串char* priv_data = nullptr;char* pub_data = nullptr;long priv_len = BIO_get_mem_data(bio_private, &priv_data);long pub_len = BIO_get_mem_data(bio_public, &pub_data);private_key = std::string(priv_data, priv_len);public_key = std::string(pub_data, pub_len);// 释放资源BIO_free_all(bio_private);BIO_free_all(bio_public);RSA_free(rsa);BN_free(bn);
}

RSA 公钥加密

// 公钥加密
std::string EncryptWithPublic(const std::string& plaintext,const std::string& public_key) {BIO* bio = BIO_new_mem_buf(public_key.c_str(), -1);RSA* rsa = PEM_read_bio_RSAPublicKey(bio, nullptr, nullptr, nullptr);BIO_free_all(bio);if (!rsa) {return "";}int rsa_size = RSA_size(rsa);int max_plaintext_len =rsa_size - 42;  // RSA_PKCS1_OAEP_PADDING 填充后最大明文长度std::string encrypted_str;for (size_t i = 0; i < plaintext.length(); i += max_plaintext_len) {size_t len =std::min(max_plaintext_len, static_cast<int>(plaintext.length() - i));unsigned char* encrypted = new unsigned char[rsa_size];int result = RSA_public_encrypt(len, reinterpret_cast<const unsigned char*>(plaintext.c_str() + i),encrypted, rsa, RSA_PKCS1_OAEP_PADDING);if (result == -1) {RSA_free(rsa);delete[] encrypted;return "";}encrypted_str.append(reinterpret_cast<char*>(encrypted), result);delete[] encrypted;}RSA_free(rsa);return encrypted_str;
}

RSA 私钥解密


// 私钥解密
std::string DecryptWithPrivate(const std::string& ciphertext,const std::string& private_key) {BIO* bio = BIO_new_mem_buf(private_key.c_str(), -1);RSA* rsa = PEM_read_bio_RSAPrivateKey(bio, nullptr, nullptr, nullptr);BIO_free_all(bio);if (!rsa) {return "";}int rsa_size = RSA_size(rsa);std::string decrypted_str;for (size_t i = 0; i < ciphertext.length(); i += rsa_size) {unsigned char* decrypted = new unsigned char[rsa_size];int result = RSA_private_decrypt(rsa_size,reinterpret_cast<const unsigned char*>(ciphertext.c_str() + i),decrypted, rsa, RSA_PKCS1_OAEP_PADDING);if (result == -1) {RSA_free(rsa);delete[] decrypted;return "";}decrypted_str.append(reinterpret_cast<char*>(decrypted), result);delete[] decrypted;}RSA_free(rsa);return decrypted_str;
}

生成ECDH 密钥对

#include <openssl/digest.h>
#include <openssl/ecdh.h>
#include <openssl/ec_key.h>
#include <openssl/hmac.h>
#include <openssl/mem.h>
#include <openssl/sha.h>
#include <openssl/cipher.h>
#include <openssl/bio.h>
#include <openssl/md5.h>
#include <openssl/pem.h>
#include <openssl/rand.h>
#include <openssl/aes.h>
bool GenECDHKeypair(int nid,std::string& public_key,std::string& private_key) {bool ret = false;EC_KEY* ec_key = nullptr;unsigned char* pub_key_buf = nullptr;unsigned char* pri_key_buf = nullptr;do {ec_key = EC_KEY_new_by_curve_name(nid);if (!ec_key) {break;}EC_KEY_set_asn1_flag(ec_key, OPENSSL_EC_NAMED_CURVE);ret = EC_KEY_generate_key(ec_key);if (ret != 1) {break;}int pub_key_size = i2o_ECPublicKey(ec_key, &pub_key_buf);if (pub_key_size == 0 || !pub_key_buf) {break;}int pri_key_size = i2d_ECPrivateKey(ec_key, &pri_key_buf);if (pri_key_size == 0 || !pri_key_buf) {break;}public_key.assign((const char*)pub_key_buf, pub_key_size);private_key.assign((const char*)pri_key_buf, pri_key_size);ret = true;} while (false);if (ec_key) {EC_KEY_free(ec_key);}if (pub_key_buf) {OPENSSL_free(pub_key_buf);}if (pri_key_buf) {OPENSSL_free(pri_key_buf);}return ret;
}

生成ECDSA 密钥对


bool GenECDSAKeypair(int nid,std::string& public_key,std::string& private_key) {bool result = false;EC_KEY* ec_key = nullptr;BIO* bio = nullptr;do {ec_key = EC_KEY_new_by_curve_name(nid);if (!ec_key) {break;}EC_KEY_set_asn1_flag(ec_key, OPENSSL_EC_NAMED_CURVE);int ret = EC_KEY_generate_key(ec_key);if (ret != 1) {break;}ret = EC_KEY_check_key(ec_key);if (ret != 1) {break;}bio = BIO_new(BIO_s_mem());ret = PEM_write_bio_EC_PUBKEY(bio, ec_key);if (ret != 1 || BIO_flush(bio) != 1) {break;}char* ptr = nullptr;long size = BIO_get_mem_data(bio, &ptr);public_key.assign(ptr, size);BIO_free(bio);bio = BIO_new(BIO_s_mem());ret = PEM_write_bio_ECPrivateKey(bio, ec_key, nullptr, nullptr, 0, nullptr,nullptr);if (ret != 1 || BIO_flush(bio) != 1) {break;}ptr = nullptr;size = BIO_get_mem_data(bio, &ptr);private_key.assign(ptr, size);result = true;} while (false);if (nullptr != bio) {BIO_free(bio);}if (nullptr != ec_key) {EC_KEY_free(ec_key);}return result;
}

生成RSA 密钥对


bool GenRsaKeypair(std::string& public_key, std::string& private_key)
{// 产生RSA密钥RSA* rsa = RSA_new();BIGNUM* bn = BN_new();BN_set_word(bn, RSA_F4);RSA_generate_key_ex(rsa, 1024, bn, NULL);// 提取私钥BIO* bio_private = BIO_new(BIO_s_mem());PEM_write_bio_RSAPrivateKey(bio_private, rsa, NULL, NULL, 0, NULL, NULL);int private_key_len = BIO_pending(bio_private);char* pem_private_key = (char*)calloc(private_key_len + 1, 1);BIO_read(bio_private, pem_private_key, private_key_len);private_key.assign(pem_private_key, private_key_len);free(pem_private_key);BIO_free(bio_private);// 提取公钥BIO* bio_public = BIO_new(BIO_s_mem());PEM_write_bio_RSA_PUBKEY(bio_public, rsa);int public_key_len = BIO_pending(bio_public);char* pem_public_key = (char*)calloc(public_key_len + 1, 1);BIO_read(bio_public, pem_public_key, public_key_len);public_key.assign(pem_public_key, public_key_len);free(pem_public_key);BIO_free(bio_public);// 释放资源RSA_free(rsa);BN_free(bn);return true;
}

SHA256 ECDH 密钥协商

inline void* Sha256(const void* in,size_t in_len,void* out,size_t* out_len) {*out_len = SHA256_DIGEST_LENGTH;return SHA256((const uint8_t*)in, in_len, (uint8_t*)out);
}bool SHA256ECDH(int nid,const std::string& public_key,const std::string& private_key,std::string& result) {bool ret = false;EC_KEY* pub_ec_key = nullptr;EC_KEY* pri_ec_key = nullptr;do {pub_ec_key = EC_KEY_new_by_curve_name(nid);if (!pub_ec_key) {break;}auto uint8_pubkey = (const uint8_t*)public_key.data();pub_ec_key = o2i_ECPublicKey(&pub_ec_key, &uint8_pubkey, public_key.size());if (!pub_ec_key) {break;}pri_ec_key = EC_KEY_new_by_curve_name(nid);if (!pri_ec_key) {break;}auto uint8_privkey = (const uint8_t*)private_key.data();pri_ec_key = d2i_ECPrivateKey(&pri_ec_key, &uint8_privkey, private_key.size());if (!pri_ec_key) {break;}result.resize(SHA256_DIGEST_LENGTH);ECDH_compute_key(result.data(), SHA256_DIGEST_LENGTH,EC_KEY_get0_public_key(pub_ec_key), pri_ec_key, Sha256);ret = true;} while (false);// free memoryif (pub_ec_key) {EC_KEY_free(pub_ec_key);}if (pri_ec_key) {EC_KEY_free(pri_ec_key);}return ret;
}

MD5 ECDH 密钥协商

inline void* MD5(const void* in,size_t in_len,void* out,size_t* out_len) {*out_len = MD5_DIGEST_LENGTH;MD5_CTX ctx;MD5_Init(&ctx);MD5_Update(&ctx, in, in_len);MD5_Final((uint8_t*)out, &ctx);return out;
}bool MD5ECDH(int nid,const std::string& public_key,const std::string& private_key,std::string& result) {bool ret = false;EC_KEY* pub_ec_key = nullptr;EC_KEY* pri_ec_key = nullptr;do {pub_ec_key = EC_KEY_new_by_curve_name(nid);if (!pub_ec_key) {break;}auto uint8_pubkey = (const uint8_t*)public_key.data();pub_ec_key = o2i_ECPublicKey(&pub_ec_key, &uint8_pubkey, public_key.size());if (!pub_ec_key) {break;}pri_ec_key = EC_KEY_new_by_curve_name(nid);if (!pri_ec_key) {break;}auto uint8_privkey = (const uint8_t*)private_key.data();pri_ec_key = d2i_ECPrivateKey(&pri_ec_key, &uint8_privkey, private_key.size());if (!pri_ec_key) {break;}result.resize(MD5_DIGEST_LENGTH);ECDH_compute_key(result.data(), MD5_DIGEST_LENGTH,EC_KEY_get0_public_key(pub_ec_key), pri_ec_key, MD5);   ret = true;} while (false);// free memoryif (pub_ec_key) {EC_KEY_free(pub_ec_key);}if (pri_ec_key) {EC_KEY_free(pri_ec_key);}return ret;
}

AES256GCM 加密


std::string Aes256GcmEncrypt(const void* once,int32_t once_len,const void* key,int32_t key_len,const void* aad,int32_t aad_len,const void* data,int32_t data_len,int tag_size,std::string& tag) {std::string result;EVP_CIPHER_CTX* ctx = EVP_CIPHER_CTX_new();EVP_CIPHER_CTX_init(ctx);EVP_EncryptInit_ex(ctx, EVP_aes_256_gcm(), nullptr, nullptr, nullptr);do {// set iv sizeint ret =EVP_CIPHER_CTX_ctrl(ctx, EVP_CTRL_GCM_SET_IVLEN, once_len, nullptr);if (ret != 1) {break;}ret = EVP_EncryptInit_ex(ctx, nullptr, nullptr, (const uint8_t*)key,(const uint8_t*)once);if (ret != 1) {break;}int out_len = 0;if (aad_len != 0) {ret = EVP_EncryptUpdate(ctx, nullptr, &out_len,(const uint8_t*)aad, aad_len);if (ret != 1) {break;}}result.resize(EVP_CIPHER_CTX_block_size(ctx) + data_len);int encrypt_len = 0;if (data_len != 0) {ret = EVP_EncryptUpdate(ctx, (uint8_t*)result.data(), &out_len,(const uint8_t*)data, data_len);if (ret != 1) {break;}encrypt_len = out_len;}ret = EVP_EncryptFinal_ex(ctx, (uint8_t*)result.data() + encrypt_len,&out_len);if (ret != 1) {break;}encrypt_len += out_len;result.resize(encrypt_len);if (tag_size != 0) {tag.resize(tag_size);ret =EVP_CIPHER_CTX_ctrl(ctx, EVP_CTRL_GCM_GET_TAG, tag_size, tag.data());if (ret != 1) {break;}}} while (false);EVP_CIPHER_CTX_free(ctx);return result;
}

AES256 GCM 解密


std::string AesGcmDecrypt(const void* once,int32_t once_len,const void* key,int32_t key_len,const void* aad,int32_t aad_len,const void* tag,int32_t tag_len,const void* data,int32_t data_len) {std::string result;EVP_CIPHER_CTX* ctx = EVP_CIPHER_CTX_new();EVP_CIPHER_CTX_init(ctx);EVP_EncryptInit_ex(ctx, EVP_aes_256_gcm(), nullptr, nullptr, nullptr);do {int ret =EVP_CIPHER_CTX_ctrl(ctx, EVP_CTRL_GCM_SET_IVLEN, once_len, nullptr);if (ret != 1) {break;}ret = EVP_DecryptInit_ex(ctx, nullptr, nullptr, (const uint8_t*)key,(const uint8_t*)once);if (ret != 1) {break;}int out_len = 0;// set aadif (aad_len != 0) {ret = EVP_DecryptUpdate(ctx, nullptr, &out_len,(const uint8_t*)aad, aad_len);if (ret != 1) {break;}}result.resize(EVP_CIPHER_CTX_block_size(ctx) + data_len);int decrypt_len = 0;if (data_len != 0) {ret = EVP_DecryptUpdate(ctx, (uint8_t*)result.data(), &out_len,(const uint8_t*)data, data_len);if (ret != 1) {break;}decrypt_len = out_len;}ret = EVP_CIPHER_CTX_ctrl(ctx, EVP_CTRL_GCM_SET_TAG, tag_len,(void*)tag);if (ret == 1) {ret = EVP_DecryptFinal_ex(ctx, (uint8_t*)result.data() + decrypt_len,&out_len);if (ret == 1) {decrypt_len += out_len;result.resize(decrypt_len);} else {result.clear();}} else {result.clear();}} while (false);EVP_CIPHER_CTX_free(ctx);return result;
}

AES 加密


std::string AESEncrypt(const std::string& key,const void* data,int32_t data_len) {if ( 0 == data_len){return "";}// 计算paddingint padding = 16 - data_len % 16;std::string padding_data(data_len + padding, (char)padding);memcpy(padding_data.data(), data, data_len);uint8_t tmp_key[16] = {};uint8_t* ptmp_key = nullptr;if (key.length() == 16) {ptmp_key = (uint8_t*)key.data();}else {ptmp_key = tmp_key;memcpy(tmp_key, key.data(), key.length() > 16 ? 16 : key.length());}uint8_t iv[16] = {};memcpy(iv, ptmp_key, 16);std::string result(padding_data.size(), 0);AES_KEY aes_key;AES_set_encrypt_key(ptmp_key, 128, &aes_key);AES_cbc_encrypt((uint8_t*)padding_data.data(), (uint8_t*)result.data(),padding_data.length(), &aes_key, iv, AES_ENCRYPT);return result;
}

AES 解密


std::string AESDecrypt(const std::string& key, const void* data, int32_t len)
{if (key.empty() || len == 0) {return "";}uint8_t tmp_key[16] = {};uint8_t* ptmp_key = nullptr;if (key.length() == 16){ptmp_key = (uint8_t*)key.data();}else{ptmp_key = tmp_key;memcpy(tmp_key, key.data(), key.length() > 16 ? 16 : key.length());}uint8_t iv[16] = {};memcpy(iv, ptmp_key, 16);std::string result(len, 0);AES_KEY aes_key;AES_set_decrypt_key(ptmp_key, 128, &aes_key);AES_cbc_encrypt((uint8_t*)data, (uint8_t*)result.data(), len,&aes_key, iv, AES_DECRYPT);// 去掉paddingchar padding = result[result.length() - 1];if (padding > 0 && padding <= 16){result.resize(result.length() - padding);}return result;
}

http://www.ppmy.cn/news/1581100.html

相关文章

期刊分区表2025年名单下载(经济学、管理学)

2025年期刊分区表包括SCIE、SSCI、A&HCI、ESCI和OAJ&#xff0c;共设置了包括自然科学、社会科学和人文科学在内的21个大类 本次分享的是期刊分区表2025年名单经济学类、管理学类&#xff0c;一共7631025条 一、数据介绍 数据名称&#xff1a;期刊分区表2025年名单 数据…

一些硬件知识【2025/3/1】

隔离电源的内部构造&#xff1a; 里面的电源驱动芯片是VPS8702&#xff0c;价格大概在1块钱左右。 可以看到其特点也正符合B0505S这种小型的隔离电源模块。其内部是一个全桥的拓扑&#xff0c;可以驱动外置变压器从而达到将外部输入电源隔离输出的目的。并且他集成了过流检测保…

C#里使用libxl来合并单元格的例子

操作EXCEL的文件格式是常用的功能&#xff0c; 通过不同的单元格的合并&#xff0c;可以生成不同的表格。 如下图所示&#xff1a; 采用libxl来创建上面的EXCEL&#xff0c;使用下面的代码来实现&#xff1a; private void button8_Click(object sender, EventArgs e) {var …

GCC 预定义宏:解锁编译器的隐藏信息

GCC 预定义宏&#xff1a;解锁编译器的隐藏信息 在 GCC 编译器中&#xff0c;有许多内置的预定义宏&#xff0c;它们可以提供编译环境的信息&#xff0c;如文件名、行号、时间、版本等。这些宏在调试、日志记录、条件编译等场景中非常有用。本文将介绍常见的 GCC 预定义宏&…

反反爬虫技术指南:原理、策略与合规实践

有很多人私下咨询爬虫技术&#xff0c;关于基础的爬虫技术我不打算介绍&#xff0c;因为网上有很多&#xff0c;CSDN都有非常多的介绍&#xff0c;就自行搜索。而今天要介绍主要是反-反-爬虫的技术指导与介绍。 引言 在如今的自媒体爆发时代&#xff0c;网络爬虫作为数据采集的…

HTML 写一个计算器

<!DOCTYPE html> <html> <head><meta charsetutf-8/><title>Calculator</title><style id"jsbin-css">div, span {margin: 0;padding: 0;font-weight: bold;font: bold 16px Arial, sans-serif;/*禁止选中文本*/-moz-user…

自学网络安全(黑客技术)2025年 —90天学习计划

&#x1f91f; 基于入门网络安全/黑客打造的&#xff1a;&#x1f449;黑客&网络安全入门&进阶学习资源包 前言 什么是网络安全 网络安全可以基于攻击和防御视角来分类&#xff0c;我们经常听到的 “红队”、“渗透测试” 等就是研究攻击技术&#xff0c;而“蓝队”、“…

学习记录-js进阶-性能优化

目录 性能优化分类实现效果性能优化实现步骤1. 准备阶段2. 防抖函数3. 节流函数4. 调用函数 完整实例代码 性能优化分类 防抖和节流 实现效果 防抖 节流 性能优化实现步骤 1. 准备阶段 理解防抖&#xff0c;节流的概念以及基本的实现方法 防抖&#xff1a;在事件执行过…