View Proposal

---

Proposer

Kai Lin Ong

Title

Quantum Walk-Based Hash Functions

Goal

Design, implementation and performance analysis of QWBHF

Description

Classical cryptographic hash functions such as SHA-256 and SHA-3 are constructed using mathematical and computational techniques designed to produce outputs that exhibit strong diffusion and appear statistically random. The student will first develop an understanding of conventional hash functions and their security requirements using introductory materials and MIT's lecture material on cryptographic hash functions. Quantum computing provides an alternative computational paradigm based on quantum mechanical phenomena such as superposition and interference. One important quantum algorithmic model is the quantum walk, which is the quantum analogue of a classical random walk. Unlike a classical random walk, a quantum walker can exist in a superposition of positions and its evolution is governed by unitary transformations. The combination of quantum walks and cryptographic hashing has been investigated in the literature. This project proposes to investigate quantum-walk-based hash functions through numerical simulation. A hash construction based on a discrete-time quantum walk will be implemented and evaluated against standard cryptographic criteria. The project will also investigate how parameters of the quantum walk, such as the number of positions, coin operation, number of walk steps and interaction mechanism, affect the quality of the resulting hash function.

Resources

Introduction to hash functions https://www.youtube.com/watch?v=KyUTuwz_b7Q MIT: https://www.youtube.com/watch?v=KqqOXndnvic Discrete-time interacting quantum walks and quantum Hash schemes https://link.springer.com/article/10.1007/s11128-012-0421-8

Background

Url

Difficulty Level

Variable

Ethical Approval

None

Number Of Students

-17

Supervisor

Kai Lin Ong

Keywords

hash function, quantum computing, quantum walk

Degrees