什么是 HTTPS 中的公钥基础设施（PKI）？
What is the public key infrastructure (PKI) behind HTTPS?
PKI 由证书颁发机构（CA）、证书和密钥组成。浏览器信任内置 CA，CA 给网站签发证书，从而让你能确认网站身份并安全交换密钥。
PKI consists of certificate authorities (CAs), certificates, and keys. Browsers trust built-in CAs that vouch for sites, letting you verify identity and exchange keys safely.
难度 专业 · 适合 高中(15-18)
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Ferguson、Schneier、Kohno,《Cryptography Engineering》Wiley,2010
N. Ferguson, B. Schneier and T. Kohno, Cryptography Engineering, Wiley, 2010
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL16596906W：Cryptography engineeri
#PKI #证书 #HTTPS
什么是同态加密（Homomorphic Encryption）？
What is homomorphic encryption?
它允许直接在密文上做计算，结果解密后等于在明文上计算的结果。这样云服务器能帮你算数据却看不到数据内容。
It lets you compute on encrypted data; decrypting the result equals computing on the plaintext. A cloud can process your data without ever seeing it.
难度 专业 · 适合 小学高段(9-12)
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Ferguson、Schneier、Kohno,《Cryptography Engineering》Wiley,2010
N. Ferguson, B. Schneier and T. Kohno, Cryptography Engineering, Wiley, 2010
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL16596906W：Cryptography engineeri
#同态加密 #隐私
什么是 RSA？它基于什么数学难题？
What is RSA, and what math problem does it rely on?
RSA 是一种非对称算法，安全性建立在两个大质数相乘容易、反过来分解乘积极难这一数学难题上。
RSA is an asymmetric algorithm whose security rests on the hardness of factoring large integers: multiplying two big primes is easy, factoring their product is extremely hard.
难度 专业 · 适合 高中(15-18)
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Ferguson、Schneier、Kohno,《Cryptography Engineering》Wiley,2010
N. Ferguson, B. Schneier and T. Kohno, Cryptography Engineering, Wiley, 2010
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL16596906W：Cryptography engineeri
#RSA #非对称加密
区块链的工作量证明（PoW）和默克尔树（Merkle Tree）分别起什么作用？
What do proof-of-work (PoW) and Merkle trees do in a blockchain?
PoW 要求矿工做大量计算来争夺记账权，使篡改历史成本极高；默克尔树把大量交易压缩成一个根哈希，方便快速验证交易是否被包含。
PoW makes miners spend heavy computation to append blocks, so rewriting history is prohibitively costly. A Merkle tree compresses many transactions into one root hash for fast inclusion proofs.
难度 专业 · 适合 小学高段(9-12)
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Ferguson、Schneier、Kohno,《Cryptography Engineering》Wiley,2010
N. Ferguson, B. Schneier and T. Kohno, Cryptography Engineering, Wiley, 2010
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL16596906W：Cryptography engineeri
#区块链 #默克尔树
量子计算对现有加密有什么威胁？什么是后量子密码？
What threat does quantum computing pose to current encryption, and what is post-quantum cryptography?
足够强的量子计算机能用 Shor 算法快速分解大数和求离散对数，威胁 RSA 与 ECC。后量子密码研究抗量子的新算法，如格密码。
A strong quantum computer could use Shor's algorithm to break RSA and ECC by factoring and discrete logs. Post-quantum cryptography builds quantum-resistant algorithms like lattice-based crypto.
难度 专业 · 适合 小学高段(9-12)
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Ferguson、Schneier、Kohno,《Cryptography Engineering》Wiley,2010
N. Ferguson, B. Schneier and T. Kohno, Cryptography Engineering, Wiley, 2010
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL16596906W：Cryptography engineeri
#量子 #加密
什么是零信任（Zero Trust）安全模型？
What is the Zero Trust security model?
零信任假定网络内外都不可信，每次访问都要验证身份、设备和权限，遵循最小权限原则，不再默认内网即安全。
Zero Trust assumes no implicit trust inside or outside the network; every access is verified for identity, device, and permission, following least privilege.
难度 进阶 · 适合 大众
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Ferguson、Schneier、Kohno,《Cryptography Engineering》Wiley,2010
N. Ferguson, B. Schneier and T. Kohno, Cryptography Engineering, Wiley, 2010
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL16596906W：Cryptography engineeri
#零信任 #安全
什么是盐（Salt）和慢哈希（如 bcrypt）？
What are a salt and slow hashing (like bcrypt)?
盐是加在密码上的随机值，让相同密码也得到不同哈希，防止查表破解。bcrypt 等故意算得慢，增加暴力破解成本。
A salt is random data added to a password so identical passwords yield different hashes, defeating lookup tables. Slow hashes like bcrypt raise the cost of brute force.
难度 进阶 · 适合 大众
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Ferguson、Schneier、Kohno,《Cryptography Engineering》Wiley,2010
N. Ferguson, B. Schneier and T. Kohno, Cryptography Engineering, Wiley, 2010
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL16596906W：Cryptography engineeri
#哈希 #盐
什么是数字证书和 CA（证书颁发机构）？
What are digital certificates and a CA (certificate authority)?
CA 是受信任的第三方，用它的私钥给网站公钥签名生成证书。浏览器用内置的 CA 公钥验证证书，从而相信网站公钥是真的。
A CA is a trusted third party that signs a site's public key with its private key to make a certificate. Browsers use built-in CA public keys to verify it.
难度 进阶 · 适合 大众
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Ferguson、Schneier、Kohno,《Cryptography Engineering》Wiley,2010
N. Ferguson, B. Schneier and T. Kohno, Cryptography Engineering, Wiley, 2010
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL16596906W：Cryptography engineeri
#证书 #CA
什么是 AES？为什么它被认为很安全？
What is AES, and why is it considered secure?
AES 是一种对称分组加密标准，用 128、192 或 256 位密钥对数据块多次混淆。它经过严格审查、无已知实用漏洞，且密钥空间巨大。
AES is a symmetric block cipher that scrambles data blocks with 128, 192, or 256-bit keys through many rounds. It is heavily vetted, has no known practical break, and a huge key space.
难度 进阶 · 适合 大众
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Ferguson、Schneier、Kohno,《Cryptography Engineering》Wiley,2010
N. Ferguson, B. Schneier and T. Kohno, Cryptography Engineering, Wiley, 2010
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL16596906W：Cryptography engineeri
#AES #对称加密
什么是密钥管理？为什么密钥要定期轮换？
What is key management, and why rotate keys regularly?
密钥管理包括生成、存储、分发和销毁密钥。定期轮换能缩小泄露后的影响范围，即使旧密钥被盗，损失也有限。
Key management covers generating, storing, distributing, and destroying keys. Regular rotation limits the blast radius of a leak, so a stolen old key does limited damage.
难度 进阶 · 适合 大众
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Ferguson、Schneier、Kohno,《Cryptography Engineering》Wiley,2010
N. Ferguson, B. Schneier and T. Kohno, Cryptography Engineering, Wiley, 2010
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL16596906W：Cryptography engineeri
#密钥管理 #安全
什么是沙箱（Sandbox）？
What is a sandbox?
沙箱是在隔离环境里运行不可信程序，限制它能访问的文件和网络，就像在玻璃箱里试危险品，坏了也不影响外面。
A sandbox runs untrusted code in an isolated space with limited file and network access, like testing dangerous material inside a glass box so the outside stays safe.
难度 进阶 · 适合 小学低段(6-8)
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Tanenbaum & Bos,《Modern Operating Systems》第4版,Pearson,2014
A. S. Tanenbaum and H. Bos, Modern Operating Systems, 4th ed., Pearson, 2014
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL1970688W：Modern Operating System
#沙箱 #隔离
什么是哈希函数？为什么密码不能明文存？
What is a hashing function, and why shouldn't passwords be stored in plain text?
哈希把任意长度输入变成固定长度的指纹，且难以反推原文。存哈希而非明文，即使数据库泄露，攻击者也拿不到真实密码。
A hash turns input into a fixed-length fingerprint that is hard to reverse. Storing hashes, not plain text, means a leak won't expose real passwords.
难度 入门 · 适合 大众
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Ferguson、Schneier、Kohno,《Cryptography Engineering》Wiley,2010
N. Ferguson, B. Schneier and T. Kohno, Cryptography Engineering, Wiley, 2010
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL16596906W：Cryptography engineeri
#哈希 #密码
什么是端到端加密（E2EE）？
What is end-to-end encryption (E2EE)?
端到端加密中，消息只在你的设备和对方设备上加解密，连提供服务的中间服务器也看不到内容，所以服务商无法偷看。
In E2EE, messages are encrypted only on your device and the recipient's, so even the service's servers can't read them; the provider can't peek.
难度 入门 · 适合 小学低段(6-8)
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Ferguson、Schneier、Kohno,《Cryptography Engineering》Wiley,2010
N. Ferguson, B. Schneier and T. Kohno, Cryptography Engineering, Wiley, 2010
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL16596906W：Cryptography engineeri
#端到端加密 #隐私
对称加密和非对称加密有什么区别？
What is the difference between symmetric and asymmetric encryption?
对称加密用同一把钥匙加解密，快但难安全传钥匙；非对称用公钥加密、私钥解密，解决了传钥匙问题但更慢。实际常用混合加密。
Symmetric uses one key for both steps, fast but hard to share safely. Asymmetric uses a public key to encrypt and a private key to decrypt, solving sharing but slower. Real systems mix both.
难度 入门 · 适合 大众
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Ferguson、Schneier、Kohno,《Cryptography Engineering》Wiley,2010
N. Ferguson, B. Schneier and T. Kohno, Cryptography Engineering, Wiley, 2010
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL16596906W：Cryptography engineeri
#加密 #对称 #非对称