Quantum Hash Research Articles

Quantum hash function based on continuous quantum walks

A method of constructing a quantum hash function (QHF) based on continuous-time quantum walk is proposed, in which the time of quantum walk is controlled by the binary string message, namely, a binary string message as the input of the constructed QHF and the probability value of finally walking to the nodes on the cycle is used as the output of the QHF. Numerical simulation and performance analysis show that our QHF has obvious advantages in the efficiency of the QHF compared with the existing QHF based on the discrete-time quantum walk, that is, the efficiency of our scheme is nearly 4 times faster in computing the hash value of the same size file compared with the most efficient scheme. Besides, the QHF has also better collision resistance compared with the existing QHF based on the discrete-time quantum walk.

QAKA: A novel quantum authentication and key agreement (QAKA) protocol using quantum entanglement for secure communication among IoT devices

AbstractThe constant evolution of the Internet of Things (IoT) concept involves the idea that all elements in the global network communication are reachable without the need for human intervention. In this context, the paramount concern is security, aiming to safeguard IoT communication against unauthorized access. According to the analysis, the security of the IoT communication framework relies on traditional cryptographic schemes like the RSA algorithm. Nevertheless, the latest developments in quantum computing and information processing pose a significant threat to these established schemes. Motivated by this fact, in this article, we proposed a novel quantum authentication and key agreement (QAKA) protocol that provides unconditional security against any classical and futuristic quantum threats. Our protocol ensures secure key agreement and mutual authentication based on quantum hashing with quantum passwords and quantum key distribution. The proposed scheme utilizes quantum teleportation and Greenberger–Horne–Zeilinger states for secure data transfer among entities. Our work is simulated using the Automated Validation of Internet Security Protocols and Applications tool to prove our protocol's formal correctness and security. The Burrows, Abadi, and Needham logic is applied to prove the goal of our protocol. Random oracle model for formal security analysis is presented in our work. Our protocol is also informally analyzed, considering the characteristics such as correctness, security against repudiation and the impossibility of cloning. The proposed protocol is compared with the related protocols in terms of various security features such as replay attacks, man‐in‐middle attacks and futuristic quantum attacks. Finally, the performance of the proposed protocol is presented, revealing superior efficacy when compared with classical authentication schemes and quantum protocols.

Constant-Depth Algorithm for Quantum Hashing

Constant-Depth Algorithm for Quantum Hashing

Efficient Implementation of Amplitude Form of Quantum Hashing Using State-of-the-Art Quantum Processors

Efficient Implementation of Amplitude Form of Quantum Hashing Using State-of-the-Art Quantum Processors

Analysis of the amplitude form of the quantum hash function

In this article, the properties of quantum hash functions are further explored. Previous findings show that so-called small-bias sets (special subsets of the set of elements of a cyclic group) generate a “phase” quantum hash function. Here, it was proved that they also generate an “amplitude” quantum hash function. Namely, it turned out that constructing small-bias sets while generating amplitude quantum functions yields a well-balanced combination of the cryptographic properties of unidirectionality and collision resistance. As a corollary of the obtained theorem, a general statement about the generation of new amplitude quantum hash functions based on universal hash families and small-bias sets was proved.

Quantum hash function based on controlled alternate lively quantum walks

Quantum hash function is an important area of interest in the field of quantum cryptography. Quantum hash function based on controlled alternate quantum walk is a mainstream branch of quantum hash functions by virtue of high efficiency and flexibility. In recent development of this kind of schemes, evolution operators determined by an input message depend on not only coin operators, but also direction-determine transforms, which usually are hard to extend. Moreover, the existing works ignore the fact that improper choice of initial parameters may cause some periodic quantum walks, and further collisions. In this paper, we propose a new quantum hash function scheme based on controlled alternate lively quantum walks with variable hash size and provide the selection criteria for coin operators. Specifically, each bit of an input message determines the magnitude of an additional long-range hop for the lively quantum walks. Statistical analysis results show excellent performance in the aspect of collision resistance, message sensitivity, diffusion and confusion property, and uniform distribution property. Our study demonstrates that a fixed coin operator, along with different shift operators, can effectively work on the design of a quantum hash function based on controlled alternate quantum walks, and shed new light on this field of quantum cryptography.

Collision Resistance of the OAM-based Quantum Hashing

Collision Resistance of the OAM-based Quantum Hashing

Cryptographic Properties of the Quantum Hashing Based on Expander Graphs

Cryptographic Properties of the Quantum Hashing Based on Expander Graphs

A 3D Cuboid Image Encryption Algorithm Based on Controlled Alternate Quantum Walk of Message Coding

In order to solve various security risks faced by image privacy protection, we propose a 3D cuboid image encryption scheme based on message-encoded controlled alternate quantum walks. Firstly, we calculated the initial parameters of the quantum system and performed a one-dimensional quantum walk to generate a probability distribution sequence. Secondly, we encoded the sequence into a quaternary message using multiple sets of encoded messages to control the alternate quantum walk model, generating a 3D probability amplitude matrix and 3D probability distribution matrix to obtain the 3D quantum hash sequence through the 3D probability distribution matrix. Then, the image was divided into blocks and integrated into a cuboid. The image cuboid was scrambled between layers using the probability value sequence, and the 3D probability distribution matrix was used to complete the scrambling of the cross-section between layers. Finally, we converted each pixel value of the scrambled cuboid into a binary cube and controlled it to perform the rotation operation through the 3D probability magnitude matrix, then used the 3D quantum hash sequence to XOR the obtained cuboid image and tilted it to obtain the final encrypted image. The simulation results show that the image encryption scheme can resist various typical attacks and has good security performance.

Multiqudit quantum hashing and its implementation based on orbital angular momentum encoding

A new version of quantum hashing technique is developed wherein a quantum hash is constructed as a sequence of single-photon high-dimensional states (qudits). A proof-of-principle implementation of the high-dimensional quantum hashing protocol using orbital-angular momentum encoding of single photons is implemented. It is shown that the number of qudits decreases with increase of their dimension for an optimal ratio between collision probability and decoding probability of the hash. Thus, increasing dimension of information carriers makes quantum hashing with single photons more efficient.

An Enhanced Dynamic Nonlinear Polynomial Integrity-Based QHCP-ABE Framework for Big Data Privacy and Security

Topics such as computational sources and cloud-based transmission and security of big data have turned out to be a major new domain of exploration due to the exponential evolution of cloud-based data and grid facilities. Various categories of cloud services have been utilized more and more widely across a variety of fields like military, army systems, medical databases, and more, in order to manage data storage and resource calculations. Attribute-based encipherment (ABE) is one of the more efficient algorithms that leads to better consignment and safety of information located within such cloud-based storage amenities. Many outmoded ABE practices are useful for smaller datasets to produce fixed-size cryptograms with restricted computational properties, in which their characteristics are measured as evidence and stagnant standards used to generate the key, encipherment, and decipherment means alike. To surmount the existing problems with such limited methods, in this work, a dynamic nonlinear poly randomized quantum hash system is applied to enhance the safety of cloud-based information. In the proposed work, users’ attributes are guaranteed with the help of a dynamic nonlinear poly randomized equation to initialize the chaotic key, encipherment, and decipherment. In this standard, structured and unstructured big data from clinical datasets are utilized as inputs. Real-time simulated outcomes demonstrate that the stated standard has superior exactness, achieving over 90% accuracy with respect to bit change and over 95% accuracy with respect to dynamic key generation, encipherment time, and decipherment time compared to existing models from the field and literature. Experimental results are demonstrated that the proposed cloud security standard has a good efficiency in terms of key generation, encoding, and decoding process than the conventional methods in a cloud computing environment.

Continuous-time quantum hash function based on one-dimensional cycle lattice

The proposed quantum hash function (QHF) based on the discrete-time quantum walk (DTQW) structure requires enlarging the coin state space and the preparation of continuous quantum states is less difficult. Hence, a new construction method of QHF is proposed based on the continuous-time quantum walk (CTQW) of the one-dimensional (1D) lattice with boundary constraints and without additional coin space. In the scheme, the input of the QHF is an arbitrary binary string message which is used to control the selected Hamiltonian of CTQW at each time interval, and the output of the QHF is the final probability distribution of CTQW. Under the same computing environment, simulation and analysis indicate that our QHF can satisfy the same security requirements such as sensitivity, diffusion and confusion, collision, birthday attack, but the collision rate is reduced by 40% without reducing effectiveness.

Quantum readout and gradient deep learning model for secure and sustainable data access in IWSN.

The industrial wireless sensor network (IWSN) is a surface-type of wireless sensor network (WSN) that suffers from high levels of security breaches and energy consumption. In modern complex industrial plants, it is essential to maintain the security, energy efficiency, and green sustainability of the network. In an IWSN, sensors are connected to the Internet in a non-monitored environment. Hence, non-authorized sensors can retrieve information from the IWSN. Therefore, to ensure that data access between sensors remains sustainable and secure, energy-efficient authentication and authorization are required. In this article, a novel Quantum Readout Gradient Secured Deep Learning (QR-GSDL) model is proposed to ensure that only trustworthy sensors can access IWSN data. The major objective of this QR-GSDL model is to create secure, energy-efficient IWSN to attain green sustainability and reduce the industrial impact on the environment. First, using the quantum readout and hash function, a registration method is designed to efficiently perform the registration process. Next, a gradient secured deep learning method is adopted to implement the authentication and authorization process in order to ensure energy-saving and secure data access. Simulations are conducted to evaluate the QR-GSDL model and compare its performance with that of three well-known models: online threshold anomaly detection, machine learning-based anomaly detection, and dynamic CNN. The simulation outcomes show that the proposed model is secure and energy-efficient for use in the IWSN. Moreover, the experimental results prove that the QR-SGDL model outperforms the existing models in terms of energy consumption, authentication rate, authentication time, and false acceptance rate.

Quantum outage probability for time-varying quantum channels

Recent experimental studies have shown that the relaxation time ${T}_{1}$ and the dephasing time ${T}_{2}$ of superconducting qubits fluctuate considerably over time. Time-varying quantum channel (TVQC) models have been proposed in order to consider the time-varying nature of the parameters that define qubit decoherence. This dynamic nature of quantum channels causes a degradation of the performance of quantum error correction codes (QECCs) that is portrayed as a flattening of their error rate curves. In this article we introduce the concepts of quantum outage probability and quantum hashing outage probability as asymptotically achievable error rates by a QECC with the quantum rate ${R}_{Q}$ operating over a TVQC. We derive closed-form expressions for the family of time-varying amplitude damping channels and study their behavior for different scenarios. We quantify the impact of time variation as a function of the relative variation of ${T}_{1}$ around its mean. We conclude that the performance of QECCs is limited in many cases by the inherent fluctuations of their decoherence parameters and corroborate that parameter stability is crucial to maintain the excellent performance observed over static quantum channels.

A quantum hash function with grouped coarse-grained boson sampling

A quantum hash function with grouped coarse-grained boson sampling

Quantum hashing via single-photon states with orbital angular momentum

Quantum hashing is a promising generalization of the cryptographic hashing concept on the quantum domain. In this paper, we construct a quantum hash via a sequence of single-photon states and perform a proof-of-principle experiment using orbital angular momentum (OAM) encoding. We experimentally verify the collision resistance of the quantum hash function depending on the number of qubits in use. Based on these results, we conclude that theoretical estimates are confirmed for different bases of OAM states and the proposed technique can be useful in computational and cryptographic scenarios. The possibility of multiplexing different OAM bases can make this approach even more efficient.

A Novel Blockchain and Bi-Linear Polynomial-Based QCP-ABE Framework for Privacy and Security over the Complex Cloud Data.

As a result of the limited resources available in IoT local devices, the large scale cloud consumer’s data that are produced by IoT related machines are contracted out to the cloud. Cloud computing is unreliable, using it can compromise user privacy, and data may be leaked. Because cloud-data and grid infrastructure are both growing exponentially, there is an urgent need to explore computational sources and cloud large-data protection. Numerous cloud service categories are assimilated into numerous fields, such as defense systems and pharmaceutical databases, to compute information space and allocation of resources. Attribute Based Encryption (ABE) is a sophisticated approach which can permit employees to specify a higher level of security for data stored in cloud storage facilities. Numerous obsolete ABE techniques are practical when applied to small data sets to generate cryptograms with restricted computational properties; their properties are used to generate the key, encrypt it, and decrypt it. To address the current concerns, a dynamic non-linear polynomial chaotic quantum hash technique on top of secure block chain model can be used for enhancing cloud data security while maintaining user privacy. In the proposed method, customer attributes are guaranteed by using a dynamic non- polynomial chaotic map function for the key initialization, encryption, and decryption. In the proposed model, both organized and unorganized massive clinical data are considered to be inputs for reliable corroboration and encoding. Compared to existing models, the real-time simulation results demonstrate that the stated standard is more precise than 90% in terms of bit change and more precise than 95% in terms of dynamic key generation, encipherment, and decipherment time.

Quantum blockchain system

Blockchain technology represented by Bitcoin and Ethereum has been deeply developed and widely used due to its broad application prospects such as digital currency and IoT. However, the security of the existing blockchain technologies built on the classical cryptography depends on the computational complexity problem. With the enhancement of the attackers’ computing power, especially the upcoming quantum computers, this kind of security is seriously threatened. Based on quantum hash, quantum SWAP test and quantum teleportation, a quantum blockchain system is proposed with quantum secure communication. In classical cryptographic theory sense, the security of this system is unconditional since it has nothing to do with the attackers’ computing power and computing resources.

Quantum-Inspired Blockchain-Based Cybersecurity: Securing Smart Edge Utilities in IoT-Based Smart Cities

Blockchain plays a vital task in cybersecurity. With the exerted efforts for realising large-scale quantum computers, most current cryptographic mechanisms may be hacked. Accordingly, we need a quantum tool utilised for designing blockchain frameworks to have the ability to be executed in the level of digital computers and resist the probable attacks from both digital and quantum computers. Quantum walks may be utilised as a quantum-inspired model for designing new cryptographic algorithms. In this paper, we present a new authentication and encryption protocol based on quantum-inspired quantum walks (QIQW). The proposed protocol is utilized to build a blockchain framework for secure data transmission among IoT devices. Instead of using classical cryptographic hash functions, quantum hash functions based on QIQW are employed for linking blocks of the chain. The main advantages of the presented framework are helping IoT nodes to effectively share their data with other nodes and full control of their records. Security analysis demonstrates that our proposed protocol can defend against message attack and impersonation attacks, thus ensuring secure transmission of data among IoT devices.

Usefulness of Decoherence in Quantum-Walk-Based Hash Function

We study the usefulness of the broken-line-type decoherence in quantum Hash functions based on discrete-time quantum walks on a cycle. We first observe that the time-evolution of probability distribution of quantum walks on a cycle is of high sensitivity to such broken-line-type decoherence, increasing with the number of steps in the walk. Based on this observation, we further propose a quantum Hash function based on the broken-line quantum walk on a cycle. Numerical simulation and performance analyses show that decoherence can be useful to improve the performances of quantum hash functions such as better diffusion and confusion, better collision resistance and more uniform distribution of hash values in the hash space. Moreover, our results promote the practical use of quantum-walk-based hash functions in realistic situations.