Figure - available from: Scientific Reports
This content is subject to copyright. Terms and conditions apply.
Asymmetric cryptography system uses an encryption key that consists of a public key and private key pair. Security in asymmetric key encryption systems relies on managing private keys without exposing them to the outside world. In contrast, public keys can be released to others. Anyone with a public key can create and send a secret message at any time, whereas someone with a private key can open the secret message at any time. In this figure, Bob, who shares Alice's public key P(A), encrypts the message m he wants to send to Alice, and Alice decrypts the message using her private key S(A).
Source publication
Here, we propose a quantum asymmetric key cryptography scheme using Grover’s quantum search algorithm. In the proposed scheme, Alice generates a pair of public and private keys, keeps the private keys safe, and only discloses public keys to the outside. Bob uses Alice's public key to send a secret message to Alice and Alice uses her private key to...
Citations
... Grover's search algorithm (Grover 1996) is one of the quantum algorithms used to achieve quantum supremacy that provides a quadratic speedup for an unstructured database compared to its classical counterpart. Many applications for optimization and machine learning that used the Grover's search algorithm have been reported (Bhuvaneswari et al. 2023;Yoon et al. 2023;Wang et al. 2023;Wu et al. 2023), demonstrating the effectiveness of the speedup. In this algorithm, the quantum circuit, called the oracle, generally requires the solutions of the task of interest in advance for circuit construction. ...
Grover adaptive search (GAS) for binary optimization (BO) problems is a quantum algorithm for iteratively finding optimal solutions using Grover’s search algorithm. However, in GAS, iterative oracle constructions are needed, and a high computational demand is required. In this study, we introduce a quantum generative model-based learning oracle and present Grover’s search with a learning oracle (GLO) for BO problems. In the GLO, a learning oracle is constructed by a parameterized unitary. Its training is performed by a hybrid quantum-classical learning framework using the cost function involving the solution constraints and the evolution strategy as a gradient-free optimization algorithm. The GLO is trained to obtain optimal solutions with probability one. The experiments conducted on the constrained BO problems demonstrate significant decreases in the number of cost function callings (query complexity) compared to GAS. Furthermore, we also discuss the effects of the entanglers (controlled Pauli Z or X gates) of the learning oracle using a model capacity measure (i.e., effective dimension). The entanglers improve the training performance of the GLO (i.e., query complexity and search success rate). The obtained results indicate the efficiency and promise of our approach.
... Beginning with a proposal by Curty et al. in 2002 [22], various QMA scheme studies have been proposed [23][24][25]. Furthermore, QMA can be extended to quantum signatures with the addition of non-repudiation [26][27][28][29][30][31][32]. ...
Quantum authentication is a fundamental first step that ensures secure quantum communication. Although various quantum authentication methods have been proposed recently, their implementation efficiency is limited. This paper proposes a key-controlled maximally mixed quantum state encryption (MMQSE) method using only a single qubit, unitary operation, minimized quantum transmissions, and a single qubit measurement, which improves implementation feasibility and operation efficiency. We applied it to representative quantum authentication applications, namely, quantum identity and message authentication. The security of our authentication schemes was verified by analyzing the relationship between the integral ratio of Uhlmann’s fidelity and probability of successful eavesdropping. Moreover, we demonstrate the higher authentication efficiency of the proposed scheme in a real quantum-channel noise environment. The upper bound of the valid noise rate was quantified using the integral ratio of Uhlmann’s fidelity in a noise environment. Finally, the optimal number of authentication sequences was estimated.
... Many researchers have worked on image security in IoMT applications to safeguard images . Because of this, encryption is a useful tool for safeguarding diagnostic images [27] , [28]. ...
The preservation of medical data integrity during the transmission process is of great significance in
upholding patient confidentiality and privacy. The incorporation of Internet of Things (IoT) technology in
the healthcare sector has added a novel aspect, whereby the transmission of medical data across networks
becomes susceptible to cyber-attacks. The statement underscores the urgent need for encryption techniques
that include both lightweight and strong characteristics and effectively safeguard medical data during
transmission. This paper introduces a novel amalgamation technique called "Integrated Chaotic-GIFT, "
which aims to achieve safe and efficient encryption of medical data conveyed over IoT networks. The
proposed model utilizes ideas derived from the chaos theory in combination with a streamlined block cipher,
resulting in a powerful but resource-efficient encryption method for medical data. This technique utilizes
complex bit-level permutations and substitutions to encode medical pictures. Furthermore, proposed the
utilization of the Chaotic-GIFT algorithm to address the safe transmission of medical data across Internet of
Things networks. The Chaotic-GIFT algorithm is characterized by its lightweight nature and high efficiency,
making it a suitable option for this purpose. The efficacy of the method is thoroughly evaluated by a
comprehensive analysis of several metrics, including the time of encryption and decryption processes, data
throughput, impact of avalanche effects, investigation of nonlinearity, and examination of correlation
coefficients
Continuous-time quantum walks provide an alternative method for quantum search problems. Most earlier studies confirmed that quadratic speedup exists in some synthetic Hamiltonians, but whether there is quadratic speedup in real physical systems remains elusive. Here, we investigate three physical systems with long-range atom-atom interaction which are possibly good candidates for realizing the quantum search, including one-dimensional atom arrays either trapped in an optical lattice or coupled to a waveguide near the band edge or dispersively coupled to a good cavity. We find that all three systems can provide a near-optimal quantum search if there is no dissipation. However, if the dissipation is considered, only the latter two systems (i.e., waveguide-QED and cavity-QED systems) can still have high success probabilities because they can significantly enhance the atom-atom interaction even if they are far apart and the spectra gap can be much larger, which can reduce the search time and the effects of dissipation significantly. Our studies here can provide helpful instructions for realizing quantum search in real physical systems in the noisy intermediate-scale quantum era.
Quantum authentication is a fundamental first step that ensures secure quantum communication. Although various quantum authentication methods have been proposed recently, their implementation efficiency is limited. This paper proposes a key-controlled maximally mixed quantum state encryption method using only a single qubit operation, which improves implementation feasibility and operation efficiency. We applied it to representative quantum authentication applications, namely, quantum identity and message authentication. The security of our authentication schemes was verified by analyzing the relationship between the integral ratio of Uhlmann's fidelity and probability of successful eavesdropping. Moreover, we demonstrate the higher authentication efficiency of the proposed scheme in a real quantum-channel noise environment.
