Quantum Hash Function 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.

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.

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.

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.

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.

Quantum hashing and Fourier transform

In the paper based on the notion of small-biased sets we define the quantum transformation that describes the quantum hash function over the cyclic group. We discuss its similarity to the well-known Quantum Fourier Transform and show possible applications to constructing space-efficient algorithms in various computational scenarios, including two-party quantum communication model, simultaneous message passing model, and the model of quantum online streaming algorithms.

Improving the Security and Authentication of the Cloud with IoT using Hybrid Optimization Based Quantum Hash Function

The security with the protection of IoT is to stay a consequential test, for the most part, because of the huge scale and dispersed nature of IoT systems. A cloud server brings wide pertinence of IoT in numerous businesses just as Government parts. Be that as it may, the security concerns, for example, verification and information protection of these gadgets assume a key job in fruitful coordination of two innovations. To build the security here, a quantum hash work system and hybrid cuckoo search-Artificial Bee Colony algorithm is displayed. A quantum hash work has been presented as an amazing system for secure correspondence of IoT and cloud because of its irregular disordered robust execution, greater affectability for introductory authority dimension, steadiness, and the exceptionally huge crucial area is hypothetically sufficiently able to oppose different known assaults. Cloud servers utilizing CS-ABC to upgrading the safe calculations through a quantum channel inside the cloud framework. Execution examinations and recreation outcomes demonstrate our presented methods are portrayed and also have greater safety, proficiency with strength opposed to a few surely understood assaults which choose them as a great contender for verifying cloud and IoT applications.

Quantum Random Oracle Model for Quantum Public-Key Encryption

Random oracle model is a general security analysis tool for rigorous security proof and effective cryptographic protocol design. In the quantum world, the attempts of constructing a quantum random oracle (QRO) have been made, such as quantum-accessible random oracle for post-quantum cryptography and quantum random oracle for quantum digital signature. As in the classical circumstance, it is crucial and challenging to design and instantiate the QRO model with an appropriate quantum hash function. In this work, we construct a QRO model for quantum public-key encryption against key-collision attack, due to the near-orthogonality property of the QRO. To explore a feasible instantiation procedure in the quantum setting, we distinctively give two instantiation examples of QRO by means of single-qubit rotation and quantum fingerprinting, and compare the numerical results of their performances under the key-collision attack. As a result, we extend the QRO model to the security analysis of quantum public-key encryption beyond quantum digital signature, and immunity from collision-type attacks.

Обобщенная квантовая хэш-функция и односторонняя защищенная передача информации

Обобщенная квантовая хэш-функция и односторонняя защищенная передача информации

Attacking Quantum Hashing. Protocols and Their Cryptanalysis

Quantumhash functions are similar to classical (cryptographic) hash functions and their security is guaranteed by physical laws. However, security of a primitive does not automatically mean that protocols based on this primitive are secure. We propose protocols based on quantum hash function and assess their security using Holevo entropy and recently introduced notion of quantum information cost.

Constructing quantum Hash functions based on quantum walks on Johnson graphs

We present a quantum hash function in a quantum walk framework on Johnson graphs. In this quantum hash function, the message bit decides which coin operator, i.e., Grover operator or DFT operator, is applied on the coin at each step. Then a fixed conditional shift operator is applied to decide the movement of the walker. Compared with existing quantum-walk-based hash functions, the present hash function has a lower collision rate and quantum resource cost. It provides a clue for the construction of other cryptography protocols by introducing the quantum walk model into hash functions.

Improving the efficiency of quantum hash function by dense coding of coin operators in discrete-time quantum walk

Li et al. first proposed a quantum hash function (QHF) in a quantum-walk architecture. In their scheme, two two-particle interactions, i.e., I interaction and π-phase interaction are introduced and the choice of I or π-phase interactions at each iteration depends on a message bit. In this paper, we propose an efficient QHF by dense coding of coin operators in discrete-time quantum walk. Compared with existing QHFs, our protocol has the following advantages: the efficiency of the QHF can be doubled and even more; only one particle is enough and two-particle interactions are unnecessary so that quantum resources are saved. It is a clue to apply the dense coding technique to quantum cryptographic protocols, especially to the applications with restricted quantum resources.

Controlled Alternate Quantum Walks based Quantum Hash Function

Through introducing controlled alternate quantum walks, we present controlled alternate quantum walks (CAQW) based quantum hash function. CAQW based quantum hash function have excellent security, outstanding statistical performance and splendid expansibility. Furthermore, due to the structure of alternate quantum walks, implementing CAQW based quantum hash function significantly reduces the resources necessary for its feasible experimental realization than implementing other quantum hash functions.

From graphs to keyed quantum hash functions

We present two new constructions of quantum hash functions: the first based on expander graphs and the second based on extractor functions and estimate the amount of randomness that is needed to construct them. We also propose a keyed quantum hash function based on extractor function that can be used in quantum message authentication codes and assess its security in a limited attacker model.

Quantum Hashing. Group approach

In this paper we consider a generalization of quantum hash functions for arbitrary groups. We show that quantum hash function exists for arbitrary abelian group. We construct a set of "good" automorphisms --- a key component of quantum hash funciton. We prove some restrictions on Hilbert space dimension and group used in quantum hash function

Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption.

Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information.

On the balanced quantum hashing

In the paper we define a notion of a resistant quantum hash function which combines a notion of pre-image (one-way) resistance and the notion of collision resistance. In the quantum setting one-way resistance property and collision resistance property are correlated: the “more” a quantum function is one-way resistant the “less” it is collision resistant and vice versa. We present an explicit quantum hash function which is “balanced” one-way resistant and collision resistant and demonstrate how to build a large family of balanced quantum hash functions.