Fully Quantum Hash Function

• URL: http://arxiv.org/abs/2408.03672v1
• Date: Wed, 7 Aug 2024 10:28:32 GMT
• Title: Fully Quantum Hash Function
• Authors: Shreya Banerjee, Harshita Meena, Somanath Tripathy, Prasanta K. Panigrahi,
• Abstract summary: We introduce a novel, textitfully quantum hash (FQH) function within the quantum walk on a cycle framework. FQH requires minimal quantum resources to produce a large hash value, providing security against the birthday attack.
• Score: 3.2923780772605604
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a novel, \textit{fully} quantum hash (FQH) function within the quantum walk on a cycle framework. We incorporate deterministic quantum computation with a single qubit to replace classical post-processing, thus increasing the inherent security. Further, our proposed hash function exhibits zero collision rate and high reliability. We further show that it provides $ > 50\%$ avalanche on average, and is highly sensitive to the initial conditions. We show comparisons of several performance metrics for the proposed FQH with different settings as well as with existing protocols to prove its efficacy. FQH requires minimal quantum resources to produce a large hash value, providing security against the birthday attack. This innovative approach thus serves as an efficient hash function and lays the foundation for potential advancements in quantum cryptography by integrating the fully quantum hash generation protocol.

Related papers

• A Quantum-Resistant Photonic Hash Function [0.0]
  We propose a quantum hash function based on Gaussian boson sampling on a photonic quantum computer. Our work lays the foundation for a new paradigm of quantum-resistant hashing with applications in emerging quantum-era information systems.
  arXiv  Detail & Related papers  (2024-09-30T04:19:26Z)
• Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement [45.386403865847235]
  Physical Unclonable Functions (PUFs) leverage inherent, non-clonable physical randomness to generate unique input-output pairs. Quantum PUFs (QPUFs) extend this concept by using quantum states as input-output pairs. We show that random unitary QPUFs cannot achieve existential unforgeability against Quantum Polynomial Time adversaries. We introduce a second model where the QPUF functions as a nonunitary quantum channel, which guarantees existential unforgeability.
  arXiv  Detail & Related papers  (2024-04-17T12:16:41Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Generalized Hybrid Search and Applications to Blockchain and Hash Function Security [50.16790546184646]
  We first examine the hardness of solving various search problems by hybrid quantum-classical strategies. We then construct a hybrid quantum-classical search algorithm and analyze its success probability.
  arXiv  Detail & Related papers  (2023-11-07T04:59:02Z)
• Controlled Alternate Quantum Walk based Block Hash Function [14.540996187637523]
  Controlled quantum walk based hash function is a kind of novel hash function, which is safe, flexible, high-efficient, and compatible. To process message in batch amounts, in this paper, controlled alternate quantum walk based block hash function is presented.
  arXiv  Detail & Related papers  (2022-05-12T09:42:17Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Quantum hashing via single-photon states with orbital angular momentum [0.0]
  We construct a quantum hash via a sequence of single-photon states and perform a proof-of-principle experiment. We experimentally verify the collision resistance of the quantum hash function depending on the number of qubits in use.
  arXiv  Detail & Related papers  (2021-10-16T10:02:01Z)
• Hash function based on controlled alternate quantum walks with memory [16.247079214644796]
  We propose a new hash function QHFM based on controlled alternate quantum walks with memory on cycles. The proposed hash function has near-ideal statistical performance and is at least on a par with the state-of-the-art hash functions based on quantum walks.
  arXiv  Detail & Related papers  (2021-05-31T08:30:08Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)
• Quantum Search for Scaled Hash Function Preimages [1.3299507495084417]
  We present the implementation of Grover's algorithm in a quantum simulator to perform a quantum search for preimages of two scaled hash functions. We show that strategies that suggest a shortcut based on sampling the quantum register after a few steps of Grover's algorithm can only provide some marginal practical advantage in terms of error mitigation.
  arXiv  Detail & Related papers  (2020-09-01T18:00:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.