Auswahl der wissenschaftlichen Literatur zum Thema „Quantum Computational Timelock, QCT“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Quantum Computational Timelock, QCT" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Quantum Computational Timelock, QCT"
LIPING, JU, und LU RUIFENG. „COMPARATIVE STUDY OF REACTION RATE CONSTANTS FOR THE NH3 + H → NH2 + H2 REACTION WITH GLOBE DYNAMICS AND TRANSITION STATE THEORIES“. Journal of Theoretical and Computational Chemistry 08, Nr. 06 (Dezember 2009): 1227–33. http://dx.doi.org/10.1142/s0219633609005325.
Der volle Inhalt der QuelleDEFAZIO, PAOLO, und CARLO PETRONGOLO. „DYNAMICS OF THE N(2D)+H2 REACTION ON THE $\tilde{X}^2 A^{\prime\prime}$ SURFACE, PROPAGATING REAL WAVE PACKETS WITH AN ARCCOS MAPPING OF THE HAMILTONIAN“. Journal of Theoretical and Computational Chemistry 02, Nr. 04 (Dezember 2003): 547–51. http://dx.doi.org/10.1142/s0219633603000732.
Der volle Inhalt der QuelleJI, LIN-BO, TING-XIAN XIE und HONG-YAN WANG. „INVESTIGATION OF THE EXCHANGE REACTION H + H′S → HS + H′ ON THE 1A′ STATE POTENTIAL ENERGY SURFACE“. Journal of Theoretical and Computational Chemistry 12, Nr. 04 (Juni 2013): 1350030. http://dx.doi.org/10.1142/s0219633613500302.
Der volle Inhalt der QuelleYUE, XIAN-FANG, JIE CHENG und HONG ZHANG. „QUASI-CLASSICAL TRAJECTORY STUDY OF THE REACTIONS N(2D) WITH H2, D2, AND HD“. Journal of Theoretical and Computational Chemistry 09, Nr. 05 (Oktober 2010): 919–24. http://dx.doi.org/10.1142/s0219633610006080.
Der volle Inhalt der QuelleVarandas, A. J. C. „Extrapolation in quantum chemistry: Insights on energetics and reaction dynamics“. Journal of Theoretical and Computational Chemistry 19, Nr. 07 (02.09.2020): 2030001. http://dx.doi.org/10.1142/s0219633620300013.
Der volle Inhalt der QuelleYANG, HERUN, ZUOYE LIU, SHAOHUA SUN, LU LI, HONGCHUAN DU und BITAO HU. „QUASI-CLASSICAL STUDY OF STEREO-DYNAMICS FOR THE REACTION C + CH → C2 + H ON THE 12A′ POTENTIAL ENERGY SURFACE“. Journal of Theoretical and Computational Chemistry 10, Nr. 01 (Februar 2011): 75–91. http://dx.doi.org/10.1142/s0219633611006323.
Der volle Inhalt der QuelleMokhtari, Majid, Samane Khoshbakht, Kobra Ziyaei, Mohammad Esmaeil Akbari und Sayyed Sajjad Moravveji. „New classifications for quantum bioinformatics: Q-bioinformatics, QCt-bioinformatics, QCg-bioinformatics, and QCr-bioinformatics“. Briefings in Bioinformatics 25, Nr. 2 (22.01.2024). http://dx.doi.org/10.1093/bib/bbae074.
Der volle Inhalt der QuellePopelier, Paul L. A. „Non-covalent interactions from a Quantum Chemical Topology perspective“. Journal of Molecular Modeling 28, Nr. 9 (25.08.2022). http://dx.doi.org/10.1007/s00894-022-05188-7.
Der volle Inhalt der QuelleDissertationen zum Thema "Quantum Computational Timelock, QCT"
Vyas, Nilesh. „Quantum cryptography in a hybrid security model“. Electronic Thesis or Diss., Institut polytechnique de Paris, 2021. http://www.theses.fr/2021IPPAT049.
Der volle Inhalt der QuelleExtending the functionality and overcoming the performance limitation of QKD requires either quantum repeaters or new security models. Investigating the latter option, we introduce the Quantum Computational Timelock (QCT) security model, assuming that computationally secure encryption may only be broken after time much longer than the coherence time of available quantum memories. These two assumptions, namely short-term computational security and noisy quantum storage, have so far already been considered in quantum cryptography, yet only disjointly. A practical lower bound on time, for which encryption is computationally secure, can be inferred from assumed long-term security of the AES256 encryption scheme (30 years) and the value of coherence time in experimental demonstrations of storage and then retrieval of optically encoded quantum information, at single-photon level range from a few nanoseconds to microseconds. Given the large gap between the upper bound on coherence time and lower bound on computational security time of an encryption scheme, the validity of the QCT security model can be assumed with a very high confidence today and also leaves a considerable margin for its validity in the future. Using the QCT security model, we propose an explicit d-dimensional key agreement protocol that we call MUB-Quantum Computational Timelock (MUB-QCT), where a bit is encoded on a qudit state using a full set of mutually unbiased bases (MUBs) and a family of pair-wise independent permutations. Security is proved by showing that upper bound on Eve's information scales as O(1=d). We show MUB-QCT offers: high resilience to error (up to 50% for large d) with fixed hardware requirements; MDI security as security is independent of channel monitoring and does not require to trust measurement devices. We also prove the security of the MUB-QCT protocol, with multiple photons per channel use, against non-adaptive attacks, in particular, proactive MUB measurement where eve measures each copy in a different MUB followed by post-measurement decoding. We prove that the MUB-QCT protocol allows secure key distribution with input states containing up to O(d) photons which implies a significant performance boost, characterized by an O(d) multiplication of key rate and a significant increase in the reachable distance. These results illustrate the power of the QCT security model to boost the performance of quantum cryptography while keeping a clear security advantage over classical cryptography