Constructing quantum Hash functions based on quantum walks on Johnson graphs

2018 ◽  
Vol 17 (7) ◽  
Author(s):  
Wei-Feng Cao ◽  
Yong-Ce Zhang ◽  
Yu-Guang Yang ◽  
Dan Li ◽  
Yi-Hua Zhou ◽  
...  
Keyword(s):  
Hash Functions ◽  
Quantum Walks ◽  
Johnson Graphs

scholarly journals Analysis of lackadaisical quantum walks

2020 ◽  
Vol 20 (13&14) ◽  
pp. 1138-1153
Author(s):  
Peter Hoyer ◽  
Zhan Yu
Keyword(s):  
Random Walk ◽  
Success Probability ◽  
Quantum Walk ◽  
Quantum Walks ◽  
Transitive Graph ◽  
Marked Vertex ◽  
Johnson Graphs ◽  
Vertex Transitive ◽  
Vertex Transitive Graphs ◽  
Transitive Graphs

The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each vertex in the graph. We analytically prove that lackadaisical quantum walks can find a unique marked vertex on any regular locally arc-transitive graph with constant success probability quadratically faster than the hitting time. This result proves several speculations and numerical findings in previous work, including the conjectures that the lackadaisical quantum walk finds a unique marked vertex with constant success probability on the torus, cycle, Johnson graphs, and other classes of vertex-transitive graphs. Our proof establishes and uses a relationship between lackadaisical quantum walks and quantum interpolated walks for any regular locally arc-transitive graph.

Hash Functions Based on Block Ciphers

2009 ◽  
Vol 20 (3) ◽  
pp. 682-691
Author(s):  
Pin LIN ◽  
Wen-Ling WU ◽  
Chuan-Kun WU
Keyword(s):  
Hash Functions ◽  
Block Ciphers

Data Integrity

2017 ◽  
Author(s):  
Keith M. Martin
Keyword(s):  
Hash Function ◽  
Hash Functions ◽  
Data Integrity ◽  
Message Authentication ◽  
Authenticated Encryption ◽  
Authentication Codes ◽  
Basic Model ◽  
Function Design ◽  
Security Properties ◽  
Different Levels

This chapter discusses cryptographic mechanisms for providing data integrity. We begin by identifying different levels of data integrity that can be provided. We then look in detail at hash functions, explaining the different security properties that they have, as well as presenting several different applications of a hash function. We then look at hash function design and illustrate this by discussing the hash function SHA-3. Next, we discuss message authentication codes (MACs), presenting a basic model and discussing basic properties. We compare two different MAC constructions, CBC-MAC and HMAC. Finally, we consider different ways of using MACs together with encryption. We focus on authenticated encryption modes, and illustrate these by describing Galois Counter mode.

scholarly journals Quantum walks defined by digraphs and generalized Hermitian adjacency matrices

2021 ◽  
Vol 20 (3) ◽  
Author(s):  
Sho Kubota ◽  
Etsuo Segawa ◽  
Tetsuji Taniguchi
Keyword(s):  
Quantum Walks ◽  
Adjacency Matrices
Sign in / Sign up

Export Citation Format

Share Document