Quantum Cryptography and Applications

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Mathematics and Computer Science".

Deadline for manuscript submissions: 31 August 2024 | Viewed by 4212

Special Issue Editors


E-Mail Website
Guest Editor
Master Program for Digital Health Innovation, College of Humanities and Sciences, China Medical University, Taichung 406040, Taiwan
Interests: quantum cryptography; quantum cryptographic protocol; quantum secure direct communication; quantum key distribution; quantum information

E-Mail Website
Guest Editor
Department of Computer Science and Information Engineering, National Taichung University of Science and Technology, Taichung 40401, Taiwan
Interests: quantum cryptography; quantum information; quantum computation; anomaly detection
Special Issues, Collections and Topics in MDPI journals
Department of Computer Science and Engineering, National Chung Hsing University, Taichung 40227, Taiwan
Interests: quantum cryptography; semi-quantum communications; multimedia authentication; anomaly detection for industrial control system; artificial intelligence in agriculture

Special Issue Information

Dear Colleagues,

In 1994, Peter Shor has developed a quantum algorithm to make the public-key cryptosystems that build on top of difficult mathematical problems, such as integer factorization and discrete logarithms that are breakable in practice. In the presence of quantum computers, Shor’s algorithm can leverage the parallel nature of quantum gates to efficiently crack the state-of-the-art classical cryptographic techniques in polynomial time, which has raised a serious security concern for the current communication systems. The discovery of Shor’s algorithm has led to a boom in quantum cryptography research. Quantum cryptography refers to the design of encryption and decryption systems using the properties of quantum physics to achieve unconditional security. The first quantum key distribution protocol was proposed by Bennett and Brassard in 1984. Since then, various quantum cryptographic communication protocols and applications have flourished. Therefore, this Special Issue aims to publish original scientific articles dedicated to quantum cryptography and its applications. We invite researchers to submit their theoretical or experimental contributions on topics including, but not limited to: quantum key distribution, quantum key agreement, quantum secret sharing, quantum private comparison, quantum summation, quantum network, quantum direct communication, deterministic quantum communication, quantum dialogue, and semi-quantum communications.

Dr. Chun-Wei Yang
Dr. Chia-Wei Tsai
Dr. Jason Lin
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • quantum key distribution
  • quantum key agreement
  • quantum secret sharing
  • quantum private comparison
  • quantum summation
  • quantum network
  • quantum direct communication
  • deterministic quantum communication
  • quantum dialogue
  • quantum digital signatures
  • quantum security analysis
  • semi-quantum communications

Published Papers (4 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

15 pages, 351 KiB  
Article
Depth-Optimized Quantum Circuits for ASCON: AEAD and HASH
by Yujin Oh, Kyungbae Jang, Anubhab Baksi and Hwajeong Seo
Mathematics 2024, 12(9), 1337; https://doi.org/10.3390/math12091337 - 27 Apr 2024
Viewed by 260
Abstract
Quantum computing advancements pose security challenges for cryptography. Specifically, Grover’s search algorithm affects the reduction in the search complexity of symmetric-key encryption and hash functions. Recent efforts have been made to estimate the complexity of Grover’s search and evaluate post-quantum security. In this [...] Read more.
Quantum computing advancements pose security challenges for cryptography. Specifically, Grover’s search algorithm affects the reduction in the search complexity of symmetric-key encryption and hash functions. Recent efforts have been made to estimate the complexity of Grover’s search and evaluate post-quantum security. In this paper, we propose a depth-optimized quantum circuit implementation for ASCON, including both symmetric-key encryption and hashing algorithms, as a part of the lightweight cryptography standardization by NIST (National Institute of Standards and Technology). As far as we know, this is the first implementation of a quantum circuit for the ASCON AEAD (Authenticated Encryption with Associated Data) scheme, which is a symmetric-key algorithm. Also, our quantum circuit implementation of the ASCON-HASH achieves a reduction of more than 88.9% in the Toffoli depth and more than 80.5% in the full depth compared to the previous work. As per our understanding, the most effective strategy against Grover’s search involves minimizing the depth of the quantum circuit for the target cipher. We showcase the optimal Grover’s search cost for ASCON and introduce a proposed quantum circuit optimized for depth. Furthermore, we utilize the estimated cost to evaluate post-quantum security strength of ASCON, employing the relevant evaluation criteria and the latest advancements in research. Full article
(This article belongs to the Special Issue Quantum Cryptography and Applications)
17 pages, 1941 KiB  
Article
Free-Space Quantum Teleportation with Orbital Angular Momentum Multiplexed Continuous Variable Entanglement
by Xinchao Ruan, Hang Zhang, Wenqi Peng, Hui Xian, Yiwu Zhu, Wei Zhao and Sha Xiong
Mathematics 2023, 11(14), 3209; https://doi.org/10.3390/math11143209 - 21 Jul 2023
Viewed by 815
Abstract
Quantum teleportation is one of the fundamental primitives of quantum cryptography. In order to achieve a wider range of high-capacity information transfer, we propose a free-space quantum teleportation (QT) protocol with orbital angular momentum (OAM) multiplexed continuous variable (CV) entangled states. The preparation [...] Read more.
Quantum teleportation is one of the fundamental primitives of quantum cryptography. In order to achieve a wider range of high-capacity information transfer, we propose a free-space quantum teleportation (QT) protocol with orbital angular momentum (OAM) multiplexed continuous variable (CV) entangled states. The preparation of the entangled states is accomplished by the spontaneous four-wave mixing (SFWM) process occurring in a hot 85Rb vapor cell, and the mode selection for the Bell-state measurement is achieved by employing the balanced homodyne detection technique. The fidelity of teleporting EPR entangled states carrying different topological charges via a Kolmogorov-type atmospheric turbulence channel is derived, and the superiority of enhancing the system channel capacity via OAM multiplexing is demonstrated. Our work provides a feasible scheme to implement high-capacity quantum communication in atmospheric environments. Full article
(This article belongs to the Special Issue Quantum Cryptography and Applications)
Show Figures

Figure 1

13 pages, 317 KiB  
Article
Robust Semi-Quantum Summation over a Collective-Dephasing Noise Channel
by Chun-Wei Yang, Chia-Wei Tsai, Chi-An Chen and Jason Lin
Mathematics 2023, 11(6), 1405; https://doi.org/10.3390/math11061405 - 14 Mar 2023
Cited by 2 | Viewed by 1037
Abstract
Quantum summation is one of the various applications in secure multi-party computation. However, most of the existing quantum summation protocols assume that the participants possess all the quantum devices. Considering future applications, the capability of the participants must be adjusted before it can [...] Read more.
Quantum summation is one of the various applications in secure multi-party computation. However, most of the existing quantum summation protocols assume that the participants possess all the quantum devices. Considering future applications, the capability of the participants must be adjusted before it can be put into practical use. Although Boyer et al. proposed that the semi-quantum environment could be used to solve this problem; another practical problem is the interference by noise. In 2022, Ye et al. proposed a two-party semi-quantum summation (SQS) protocol resistant to the interference of collective noise, in which two classical participants can accomplish the summation of their private binary sequences with the assistance of a quantum semi-honest third party. They proved that their SQS protocol is resistant to various eavesdropping attacks. This paper unveils two risks of information leakage in Ye et al.’s SQS protocol. If the aforementioned security issues are not resolved, Ye et al.’s SQS protocol may not be able to perform private quantum computations securely. Fortunately, the SQS protocol against the collective-dephasing noise proposed in this study is free from the issue of information leakage as well as resistant to various quantum attacks. In addition, the quantum efficiency of the SQS protocol proposed in this study is four times higher than that of Ye et al.’s SQS protocol, which can effectively improve the quantum utilization rate. Full article
(This article belongs to the Special Issue Quantum Cryptography and Applications)
14 pages, 1574 KiB  
Article
Semi-Quantum Identification without Information Leakage
by Chun-Wei Yang, Hung-Wen Wang, Jason Lin and Chia-Wei Tsai
Mathematics 2023, 11(2), 452; https://doi.org/10.3390/math11020452 - 14 Jan 2023
Cited by 2 | Viewed by 1162
Abstract
In 2019, Zhou et al. proposed semi-quantum identification (also known as semi-quantum authentication, SQA), which proceeds under a measure-resend and measurement-free environment. However, Zhou et al.’s SQA protocol suffers from severe information leakages. An eavesdropper can obtain an intact authentication key without being [...] Read more.
In 2019, Zhou et al. proposed semi-quantum identification (also known as semi-quantum authentication, SQA), which proceeds under a measure-resend and measurement-free environment. However, Zhou et al.’s SQA protocol suffers from severe information leakages. An eavesdropper can obtain an intact authentication key without being detected under this environment. In particular, Zhou et al.’s measure-resend SQA protocol is vulnerable to double CNOT attacks, while the measurement-free SQA protocol is vulnerable to man-in-the-middle attacks. Hence, this study reveals the severe security issues of Zhou et al.’s SQA protocol and proposes an improved protocol with guaranteed security. The proposed measure-resend SQA protocol is immune to double CNOT attacks. Since the photons sent back and forth are identical, Eve cannot obtain any information by cross-comparing these photons. In the proposed measurement-free SQA protocol, the eavesdropper cannot obtain the order of the transmitted photons because it was previously a pre-shared key to decide the order of the photons. Hence, the proposed measurement-free SQA protocol can withstand man-in-the-middle attacks. Full article
(This article belongs to the Special Issue Quantum Cryptography and Applications)
Show Figures

Figure 1

Back to TopTop