方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| Shor 算法× | 量子密钥分发 (BB84)× | |
|---|---|---|
| 领域 | 量子计算 | 量子计算 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1994 | 1984 |
| 提出者≠ | Peter Shor | Charles Bennett and Gilles Brassard |
| 类型≠ | Quantum algorithm | Cryptographic protocol |
| 开创性文献≠ | Shor, P. W. (1994). Algorithms for quantum computation: discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 124–134. DOI ↗ | Bennett, C. H., Brassard, G. (1984). Quantum cryptography: public key distribution and coin tossing. Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, 175–179. link ↗ |
| 别名 | Shor factorization, quantum factorization | BB84, quantum cryptography |
| 相关≠ | 3 | 2 |
| 摘要≠ | Shor's Algorithm is a polynomial-time quantum algorithm for factoring large integers and computing discrete logarithms, problems believed to be intractable on classical computers. Discovered by Peter Shor in 1994, it demonstrated the potential of quantum computers to break widely used cryptographic systems like RSA, marking a landmark in quantum computing theory. | Quantum Key Distribution (QKD) BB84 is a cryptographic protocol allowing two parties to establish a shared secret key using quantum mechanics. Proposed by Bennett and Brassard in 1984, BB84 provides information-theoretic security: an eavesdropper's presence is guaranteed to be detected, and the secret key is provably secure against unlimited computational power. |
| ScholarGate数据集 ↗ |
|
|