Quantum-Safe Hashing Algorithm
| dc.contributor.author | Dana Abushawish | |
| dc.date.accessioned | 2025-02-04T06:49:36Z | |
| dc.date.available | 2025-02-04T06:49:36Z | |
| dc.date.issued | 2025-02-03 | |
| dc.description.abstract | In the era of quantum computing, ensuring cryptographic security requires innovative approaches. This project introduces a post-quantum cryptographic hashing algorithm designed to resist quantum-based attacks, particularly Grover’s algorithm. The proposed method utilizes two random oracles to generate entropy dynamically, following Boltzmann’s entropy formula and the concept of microstates. By leveraging this dynamic entropy mechanism, the algorithm produces a quantum- safe hash value that is computationally infeasible to reverse or find its preimage. Experimental evaluations demonstrate the robustness of the algorithm in providing enhanced security against quantum threats, offering a a significant step forward in post-quantum cryptographic research. | |
| dc.identifier.uri | https://hdl.handle.net/20.500.11888/19879 | |
| dc.language.iso | en | |
| dc.supervisor | Othman Othman | |
| dc.title | Quantum-Safe Hashing Algorithm | |
| dc.type | Graduation Project |
Files
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: