Добірка наукової літератури з теми "Quantum Computational Timelock, QCT"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Зміст
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Quantum Computational Timelock, QCT".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Quantum Computational Timelock, QCT"
LIPING, JU, and 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, no. 06 (December 2009): 1227–33. http://dx.doi.org/10.1142/s0219633609005325.
Повний текст джерелаDEFAZIO, PAOLO, and 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, no. 04 (December 2003): 547–51. http://dx.doi.org/10.1142/s0219633603000732.
Повний текст джерелаJI, LIN-BO, TING-XIAN XIE, and 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, no. 04 (June 2013): 1350030. http://dx.doi.org/10.1142/s0219633613500302.
Повний текст джерелаYUE, XIAN-FANG, JIE CHENG, and HONG ZHANG. "QUASI-CLASSICAL TRAJECTORY STUDY OF THE REACTIONS N(2D) WITH H2, D2, AND HD." Journal of Theoretical and Computational Chemistry 09, no. 05 (October 2010): 919–24. http://dx.doi.org/10.1142/s0219633610006080.
Повний текст джерелаVarandas, A. J. C. "Extrapolation in quantum chemistry: Insights on energetics and reaction dynamics." Journal of Theoretical and Computational Chemistry 19, no. 07 (September 2, 2020): 2030001. http://dx.doi.org/10.1142/s0219633620300013.
Повний текст джерелаYANG, HERUN, ZUOYE LIU, SHAOHUA SUN, LU LI, HONGCHUAN DU, and 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, no. 01 (February 2011): 75–91. http://dx.doi.org/10.1142/s0219633611006323.
Повний текст джерелаMokhtari, Majid, Samane Khoshbakht, Kobra Ziyaei, Mohammad Esmaeil Akbari, and Sayyed Sajjad Moravveji. "New classifications for quantum bioinformatics: Q-bioinformatics, QCt-bioinformatics, QCg-bioinformatics, and QCr-bioinformatics." Briefings in Bioinformatics 25, no. 2 (January 22, 2024). http://dx.doi.org/10.1093/bib/bbae074.
Повний текст джерелаPopelier, Paul L. A. "Non-covalent interactions from a Quantum Chemical Topology perspective." Journal of Molecular Modeling 28, no. 9 (August 25, 2022). http://dx.doi.org/10.1007/s00894-022-05188-7.
Повний текст джерелаДисертації з теми "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.
Повний текст джерелаExtending 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