Confronta i metodi
Esamina i metodi selezionati fianco a fianco; le righe che differiscono sono evidenziate.
| Algoritmo di Shor× | Quantum Key Distribution (BB84)× | |
|---|---|---|
| Campo | Calcolo quantistico | Calcolo quantistico |
| Famiglia | Machine learning | Machine learning |
| Anno di origine≠ | 1994 | 1984 |
| Ideatore≠ | Peter Shor | Charles Bennett and Gilles Brassard |
| Tipo≠ | Quantum algorithm | Cryptographic protocol |
| Fonte seminale≠ | 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 ↗ |
| Alias | Shor factorization, quantum factorization | BB84, quantum cryptography |
| Correlati≠ | 3 | 2 |
| Sintesi≠ | 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. |
| ScholarGateInsieme di dati ↗ |
|
|