Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| Κβαντική Διανομή Κλειδιού (BB84)× | Αλγόριθμος του Shor× | |
|---|---|---|
| Πεδίο | Κβαντική Υπολογιστική | Κβαντική Υπολογιστική |
| Οικογένεια | Machine learning | Machine learning |
| Έτος προέλευσης≠ | 1984 | 1994 |
| Δημιουργός≠ | Charles Bennett and Gilles Brassard | Peter Shor |
| Τύπος≠ | Cryptographic protocol | Quantum algorithm |
| Θεμελιώδης πηγή≠ | 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, 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 ↗ |
| Εναλλακτικές ονομασίες | BB84, quantum cryptography | Shor factorization, quantum factorization |
| Συναφείς≠ | 2 | 3 |
| Σύνοψη≠ | 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. | 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. |
| ScholarGateΣύνολο δεδομένων ↗ |
|
|