<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/" xmlns:media="http://search.yahoo.com/mrss/"><channel><title>加密算法 on Hex Blog</title><link>https://hex-go.github.io/tags/%E5%8A%A0%E5%AF%86%E7%AE%97%E6%B3%95/</link><description>Recent content in 加密算法 on Hex Blog</description><generator>Hugo -- gohugo.io</generator><language>zh</language><managingEditor>hex-py@gmail.com (Hex)</managingEditor><webMaster>hex-py@gmail.com (Hex)</webMaster><copyright>©2026, All Rights Reserved</copyright><lastBuildDate>Tue, 09 Nov 2021 11:07:58 +0000</lastBuildDate><atom:link href="https://hex-go.github.io/tags/%E5%8A%A0%E5%AF%86%E7%AE%97%E6%B3%95/index.xml" rel="self" type="application/rss+xml"/><item><title>RSA算法原理</title><link>https://hex-go.github.io/posts/%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%8E%9F%E7%90%86/2021-11-09-rsa%E7%AE%97%E6%B3%95%E5%8E%9F%E7%90%86/</link><pubDate>Tue, 09 Nov 2021 11:07:58 +0000</pubDate><author>hex-py@gmail.com (Hex)</author><atom:modified>Tue, 09 Nov 2021 11:07:58 +0000</atom:modified><guid>https://hex-go.github.io/posts/%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%8E%9F%E7%90%86/2021-11-09-rsa%E7%AE%97%E6%B3%95%E5%8E%9F%E7%90%86/</guid><description>重要 RSA安全性基于质因数分解困难性：p × q = N 容易，但 N → p, q 极难。 核心：欧拉定理保证解密有效，模反元素保证加解密互逆。 变量速查 变量 说明 公</description><dc:creator>Hex</dc:creator><category>计算机原理</category><category>面试</category><category>RSA</category><category>加密算法</category><category>计算机原理</category></item></channel></rss>