能不能向别人证明我知道保险箱密码,却一个字都不泄露密码本身?
Can you prove to someone that you know the safe combination without revealing a single word of it?
零知识证明做到了这件反直觉的事:证明者通过多轮随机交互让验证者确信命题为真,但验证者除命题为真外一无所获。经典比喻是色盲朋友与两颗外观相同的球:你蒙着眼在他背后交换或不动球,他猜交换与否,只要球真有颜色差,你总能答对他抛出的硬币面;重复几十轮全对的概率趋近于一,而色盲朋友始终不知道红绿之分。戈德瓦塞尔等人1989年将其形式化,如今支撑着区块链隐私交易与身份认证协议——数学上把「知道」与「证明知道」干净地分了家。
Zero-knowledge proofs achieve the counterintuitive: through randomized interaction the verifier becomes certain the claim is true yet learns nothing beyond that. Picture a colorblind friend holding two identical-looking balls: behind his back you either swap them or not as he flips a coin; if they truly differ in color you always answer correctly, so dozens of perfect rounds convince him while he never learns red from green. Goldwasser, Micali and Rackoff formalized this in 1989; today it powers privacy-preserving blockchain transactions and authentication — mathematics cleanly separating knowing from proving you know.
难度 专业 · 适合 高中(15-18)
CC BY 4.0 · 已核验 · Verified 2026-08-23 · 2 条独立证据
来源 · Source
Graham, Knuth, Patashnik,《Concrete Mathematics》第2版,Addison-Wesley,1994
R. L. Graham et al., Concrete Mathematics, 2nd ed., Addison-Wesley, 1994
独立核验依据 · Independent verification: 核验依据 2 OPENLIBRARY 标识 /works/OL3951639W：Concrete mathematics（按标
#零知识证明 #交互式协议 #密码学
网购时银行卡信息满网飞,为什么几乎没人能偷走?RSA 的底气从哪来?
Your card details fly across the internet when you shop online — why can almost nobody steal them? Where does RSA get its confidence?
因为数学给「顺向容易、逆向极难」提供了严格实例。RSA 把两个大质数相乘作为公开钥匙,乘法任何人瞬间完成;但要从几百位长的乘积反推这两个质数,已知最好的通用算法在经典计算机上耗时随位数超多项增长,2048位密钥按现有估算所需时间远超宇宙年龄（普遍给出10^12年以上量级）。解密的私钥则利用费马-欧拉定理构造,只有掌握质数因子的持有者才能算出。整个体系的安全性押注在「大数分解实际不可行」这一计算复杂性事实上,而非保密算法——算法是公开的,难的是数学本身。
Mathematics provides a rigorous easy-forward, hard-backward task. RSA publishes the product of two large primes as its public key; multiplication takes anyone an instant, but recovering those factors from a 300-digit product grows super-polynomially with size — for 2048-bit keys, current estimates put the required time far beyond the age of the universe (order 10^12 years or more). The private key exploits Fermat-Euler modular arithmetic available only to whoever holds the factors. Security rests on the computational-infeasibility of factoring, not on hiding the algorithm, which is fully public — what is hard is the mathematics itself.
难度 进阶 · 适合 高中(15-18)
CC BY 4.0 · 已核验 · Verified 2026-11-03
来源 · Source
Rivest、Shamir 与 Adleman,《A Method for Obtaining Digital Signatures and Public-Key Cryptosystems》,Communications of the ACM 第21卷,1978
R. L. Rivest, A. Shamir and L. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM 21, 1978
独立核验依据 · Independent verification: 核验依据 1 INSPIRE 标识 10.1145/359340.359342：A method for obtaining
#RSA #公钥密码 #大数分解
光盘刮花了为什么还能播放?数据传输有噪声为什么信息不丢?
Why do scratched CDs still play — why does noisy transmission lose no information?
因为存储和传输的数据里掺入了精心设计的冗余。香农1948年证明:只要传输速率低于信道容量,就存在让误码率任意小的编码方法——噪声不再是宿命。工程实现如汉明码给数据块添加校验位,接收端据此定位并翻转出错的那一位;里德-所罗门码更进一步,把数据视为多项式系数,靠过点插值恢复被擦除的整段字节,这正是CD抗划痕、二维码缺角可扫、深空探测器在木星轨道仍能回传照片的同一套数学。代价是冗余开销,编码理论研究的正是这个性价比的极致。
Stored and transmitted data carry deliberate redundancy. Shannon proved in 1948 that below channel capacity, codes exist driving error rates arbitrarily low — noise is not destiny. Hamming codes append parity bits letting receivers locate and flip the wrong bit; Reed-Solomon codes treat data as polynomial coefficients and interpolate through erased spans whole — one mathematics behind scratch-proof CDs, scannable damaged QR codes and deep-space probes phoning home from Jupiter. Redundancy is the overhead, and coding theory optimizes exactly that trade.
难度 进阶 · 适合 初中(12-15)
CC BY 4.0 · 已核验 · Verified 2026-11-02
来源 · Source
Hamming,《Error Detecting and Error Correcting Codes»,Bell System Technical Journal 第29卷,1950
R. W. Hamming, Error Detecting and Error Correcting Codes, Bell System Technical Journal 29, 1950
独立核验依据 · Independent verification: 核验依据 1 CROSSREF 标识 10.1002/j.1538-7305.1950.tb00463.x：Error Det
#纠错码 #汉明码 #里德所罗门码