{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:09:54Z","timestamp":1760234994177,"version":"build-2065373602"},"reference-count":29,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T00:00:00Z","timestamp":1625616000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>This paper introduces a novel entanglement-based QKD protocol, that makes use of a modified symmetric version of the Bernstein-Vazirani algorithm, in order to achieve secure and efficient key distribution. Two variants of the protocol, one fully symmetric and one semi-symmetric, are presented. In both cases, the spatially separated Alice and Bob share multiple EPR pairs, each one qubit of the pair. The fully symmetric version allows both parties to input their tentative secret key from their respective location and acquire in the end a totally new and original key, an idea which was inspired by the Diffie-Hellman key exchange protocol. In the semi-symmetric version, Alice sends her chosen secret key to Bob (or vice versa). The performance of both protocols against an eavesdroppers attack is analyzed. Finally, in order to illustrate the operation of the protocols in practice, two small scale but detailed examples are given.<\/jats:p>","DOI":"10.3390\/e23070870","type":"journal-article","created":{"date-parts":[[2021,7,8]],"date-time":"2021-07-08T04:32:49Z","timestamp":1625718769000},"page":"870","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["QKD Based on Symmetric Entangled Bernstein-Vazirani"],"prefix":"10.3390","volume":"23","author":[{"given":"Michael","family":"Ampatzis","sequence":"first","affiliation":[{"name":"Department of Informatics, Ionian University, 7 Tsirigoti Square, 49100 Corfu, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3741-1271","authenticated-orcid":false,"given":"Theodore","family":"Andronikos","sequence":"additional","affiliation":[{"name":"Department of Informatics, Ionian University, 7 Tsirigoti Square, 49100 Corfu, Greece"}]}],"member":"1968","published-online":{"date-parts":[[2021,7,7]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0036144598347011","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"41","author":"Shor","year":"1999","journal-title":"SIAM Rev."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Grover, L. (1996, January 22\u201324). A fast quantum mechanical algorithm for database search. Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237866"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Chen, L., Chen, L., Jordan, S., Liu, Y.K., Moody, D., Peralta, R., Perlner, R., and Smith-Tone, D. (2016). Report on POST-Quantum Cryptography, US Department of Commerce, National Institute of Standards and Technology.","DOI":"10.6028\/NIST.IR.8105"},{"key":"ref_4","unstructured":"Bennett, C.H., and Brassard, G. (1984, January 10\u201312). Quantum Cryptography: Public Key Distribution and Coin Tossing. Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1103\/PhysRevLett.67.661","article-title":"Quantum cryptography based on Bell\u2019s theorem","volume":"67","author":"Ekert","year":"1991","journal-title":"Phys. Rev. Lett."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/74074.74087","article-title":"Experimental quantum cryptography: The dawn of a new era for quantum cryptography: The experimental prototype is working","volume":"20","author":"Bennett","year":"1989","journal-title":"ACM Sigact News"},{"key":"ref_7","first-page":"138","article-title":"Current status of the DARPA quantum network","volume":"Volume 5815","author":"Elliott","year":"2005","journal-title":"Quantum Information and Computation III"},{"key":"ref_8","unstructured":"Elliott, C. (2018). The DARPA quantum network. Quantum Communications and Cryptography, CRC Press."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"075001","DOI":"10.1088\/1367-2630\/11\/7\/075001","article-title":"The SECOQC quantum key distribution network in Vienna","volume":"11","author":"Peev","year":"2009","journal-title":"New J. Phys."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"10387","DOI":"10.1364\/OE.19.010387","article-title":"Field test of quantum key distribution in the Tokyo QKD Network","volume":"19","author":"Sasaki","year":"2011","journal-title":"Opt. Express"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1038\/nature23655","article-title":"Satellite-to-ground quantum key distribution","volume":"549","author":"Liao","year":"2017","journal-title":"Nature"},{"key":"ref_12","first-page":"553","article-title":"Rapid solution of problems by quantum computation","volume":"439","author":"Deutsch","year":"1992","journal-title":"Proc. R. Soc. Lond. Ser. A Math. Phys. Sci."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1137\/S0097539796300921","article-title":"Quantum Complexity Theory","volume":"26","author":"Bernstein","year":"1997","journal-title":"SIAM J. Comput."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1474","DOI":"10.1137\/S0097539796298637","article-title":"On the Power of Quantum Computation","volume":"26","author":"Simon","year":"1997","journal-title":"SIAM J. Comput."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2887","DOI":"10.1007\/s10773-017-3456-x","article-title":"Quantum Cryptography Based on the Deutsch-Jozsa Algorithm","volume":"56","author":"Nagata","year":"2017","journal-title":"Int. J. Theor. Phys."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2086","DOI":"10.1007\/s10773-017-3352-4","article-title":"Quantum Cryptography, Quantum Communication, and Quantum Computer in a Noisy Environment","volume":"56","author":"Nagata","year":"2017","journal-title":"Int. J. Theor. Phys."},{"key":"ref_17","first-page":"6","article-title":"Secure quantum key distribution based on a special Deutsch-Jozsa algorithm","volume":"2","author":"Nagata","year":"2017","journal-title":"Asian J. Math. Phys."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions in cryptography","volume":"22","author":"Diffie","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.tcs.2014.05.025","article-title":"Quantum cryptography: Public key distribution and coin tossing","volume":"560","author":"Bennett","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"033027","DOI":"10.1088\/1367-2630\/12\/3\/033027","article-title":"Quantum dice rolling: A multi-outcome generalization of quantum coin flipping","volume":"12","author":"Aharon","year":"2010","journal-title":"New J. Phys."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1103\/PhysRevLett.82.1052","article-title":"Quantum strategies","volume":"82","author":"Meyer","year":"1999","journal-title":"Phys. Rev. Lett."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"3077","DOI":"10.1103\/PhysRevLett.83.3077","article-title":"Quantum games and quantum strategies","volume":"83","author":"Eisert","year":"1999","journal-title":"Phys. Rev. Lett."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Andronikos, T., Sirokofskich, A., Kastampolidou, K., Varvouzou, M., Giannakis, K., and Singh, A. (2018). Finite Automata Capturing Winning Sequences for All Possible Variants of the PQ Penny Flip Game. Mathematics, 6.","DOI":"10.3390\/math6020020"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Andronikos, T., and Sirokofskich, A. (2021). The Connection between the PQ Penny Flip Game and the Dihedral Groups. Mathematics, 9.","DOI":"10.3390\/math9101115"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Giannakis, K., Theocharopoulou, G., Papalitsas, C., Fanarioti, S., and Andronikos, T. (2019). Quantum Conditional Strategies and Automata for Prisoners\u2019 Dilemmata under the EWL Scheme. Appl. Sci., 9.","DOI":"10.20944\/preprints201905.0366.v1"},{"key":"ref_26","unstructured":"Nielsen, M.A., and Chuang, I.L. (2010). Quantum Computation and Quantum Information, Cambridge University Press."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Mermin, N. (2007). Quantum Computer Science: An Introduction, Cambridge University Press.","DOI":"10.1017\/CBO9780511813870"},{"key":"ref_28","unstructured":"Qiskit (2021, June 05). Qiskit Open-Source Quantum Development. Available online: https:\/\/qiskit.org."},{"key":"ref_29","unstructured":"Qasm (2021, July 03). The Qasm Simulator. Available online: https:\/\/qiskit.org\/documentation\/stubs\/qiskit.providers.aer.QasmSimulator.html."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/7\/870\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:27:31Z","timestamp":1760164051000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/7\/870"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,7]]},"references-count":29,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2021,7]]}},"alternative-id":["e23070870"],"URL":"https:\/\/doi.org\/10.3390\/e23070870","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2021,7,7]]}}}