Quantum Cryptography with Virginia Tech
By Lavanya
My project focuses on utilizing Grover's Algorithm, an advanced quantum algorithm designed to enhance the probability of finding the correct solution in unstructured search problems. The primary application is in quantum cryptography, where Grover's Algorithm is used to analyze and potentially break classical encryption schemes by significantly reducing the time required for brute-force attacks. I am grateful to be under the guidance of Dr. Atul Mantri, a professor at Virginia Tech.
As part of this research, I am also applying Grover's Algorithm to Boolean satisfiability (SAT) problems, which involve determining whether there exists a set of inputs that satisfy a given logical formula. This serves as a foundational study for broader applications in optimization and problem-solving. In this case, I will utilize what I learned from these SAT problems to solve more complex encryption problems. Additionally, the project includes an analysis and comparison of Simon’s Algorithm, another quantum algorithm, and its potential uses in cryptography and data pattern recognition. These investigations aim to deepen our understanding of quantum computing’s implications for secure data systems and for future developments in quantum technology.