Application of Quantum Walks in Quantum Cryptography
In this research article, we worked on construction of quantum hash function utilizing quantum walks over Petersen graph. We chose the Petersen graph, known for its highly symmetric structure and robust connectivity, as the underlying graph for the quantum walk dynamics. Quantum walks show excellent probabilistic behavior and strong mixing properties, providing a powerful mathematical framework for designing cryptographic primitives. The proposed quantum hash function demonstrates high sensitivity and essential diffusion-confusion metrics. Our results highlight the application of quantum walks to quantum cryptography, offering a scalable and stable quantum hash function.
Authors
- Navneet Pratap Singh (ORCID: https://orcid.org/0000-0001-6403-2229)
- Rachana Soni (ORCID: https://orcid.org/0000-0003-3939-2809)
- Neelam Choudhary (ORCID: https://orcid.org/0000-0002-2592-8134)
Institutions
- Bennett University (IN)
Publication Details
- Published
- 2025-03-28
- DOI
- https://doi.org/10.1109/ngise64126.2025.11085235
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.00