Controlled Alternate Quantum Walk based Block Hash Function

• URL: http://arxiv.org/abs/2205.05983v1
• Date: Thu, 12 May 2022 09:42:17 GMT
• Title: Controlled Alternate Quantum Walk based Block Hash Function
• Authors: Dan Li, Panpan Ding, Yuqian Zhou, Yuguang Yang
• Abstract summary: 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.
• Score: 14.540996187637523
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The hash function is an important branch of cryptology. Controlled quantum walk based hash function is a kind of novel hash function, which is safe, flexible, high-efficient, and compatible. All existing controlled quantum walk based hash functions are controlled by one bit message in each step. To process message in batch amounts, in this paper, controlled alternate quantum walk based block hash function is presented by using the time-position-dependent controlled quantum walks on complete graphs with self-loops. The presented hash function accelerate the hash processing dramatically, so it is more high-efficient.

Related papers

• Fully Quantum Hash Function [3.2923780772605604]
  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.
  arXiv  Detail & Related papers  (2024-08-07T10:28:32Z)
• Automated Quantum Circuit Generation for Computing Inverse Hash Functions [0.29998889086656577]
  Several cryptographic systems depend upon the computational difficulty of reversing cryptographic hash functions. Hash functions can be cryptographically secure, and they are employed in encryption, authentication, and other security methods. It has been suggested that such cryptographically-secure hash functions will play a critical role in the era of post-quantum cryptography.
  arXiv  Detail & Related papers  (2024-04-26T03:55:46Z)
• Quantum One-Wayness of the Single-Round Sponge with Invertible Permutations [49.1574468325115]
  Sponge hashing is a widely used class of cryptographic hash algorithms. Intrepid permutations have so far remained a fundamental open problem. We show that finding zero-pairs in a random $2n$-bit permutation requires at least $Omega (2n/2)$ many queries.
  arXiv  Detail & Related papers  (2024-03-07T18:46:58Z)
• Quantum-inspired Hash Function Based on Parity-dependent Quantum Walks with Memory [25.487508611436425]
  We construct a quantum-inspired hash function (called QHFM-P) based on this model. Numerical simulation shows that QHFM-P has near-ideal statistical performance. Stability test illustrates that the statistical properties of the proposed hash function are robust with respect to the coin parameters.
  arXiv  Detail & Related papers  (2023-08-10T05:54:32Z)
• Unified Functional Hashing in Automatic Machine Learning [58.77232199682271]
  We show that large efficiency gains can be obtained by employing a fast unified functional hash. Our hash is "functional" in that it identifies equivalent candidates even if they were represented or coded differently. We show dramatic improvements on multiple AutoML domains, including neural architecture search and algorithm discovery.
  arXiv  Detail & Related papers  (2023-02-10T18:50:37Z)
• A Lower Bound of Hash Codes' Performance [122.88252443695492]
  In this paper, we prove that inter-class distinctiveness and intra-class compactness among hash codes determine the lower bound of hash codes' performance. We then propose a surrogate model to fully exploit the above objective by estimating the posterior of hash codes and controlling it, which results in a low-bias optimization. By testing on a series of hash-models, we obtain performance improvements among all of them, with an up to $26.5%$ increase in mean Average Precision and an up to $20.5%$ increase in accuracy.
  arXiv  Detail & Related papers  (2022-10-12T03:30:56Z)
• Quantum collision finding for homomorphic hash functions [0.0]
  We present concrete attack examples to provable hash functions, including a preimage attack to $oplus$-linear hash functions. Hash functions which are additive or multiplicative are vulnerable to a quantum attack using the hidden subgroup problem algorithm for quantum computers.
  arXiv  Detail & Related papers  (2021-07-30T23:01:02Z)
• 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)
• Reinforcing Short-Length Hashing [61.75883795807109]
  Existing methods have poor performance in retrieval using an extremely short-length hash code. In this study, we propose a novel reinforcing short-length hashing (RSLH) In this proposed RSLH, mutual reconstruction between the hash representation and semantic labels is performed to preserve the semantic information. Experiments on three large-scale image benchmarks demonstrate the superior performance of RSLH under various short-length hashing scenarios.
  arXiv  Detail & Related papers  (2020-04-24T02:23:52Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.