Summary
In this chapter, we have analyzed quantum computing and searching algorithms for quantum cryptography. After introducing the basic principles of quantum programming and quantum gates, we discovered how to build Grover’s algorithm for quantum search.
However, Grover’s algorithm hasn’t yet improved on the process of exponentially searching an unstructured database; it is only a great starting point for creating new and more efficient quantum algorithms. As we have seen in this chapter, this model of searching is not yet feasible, given the high number of qubits required to obtain the target solution. When implemented, the possible future applications of quantum search in cryptography will be potentially devastating for classical cryptographic algorithms. Indeed, the problem of searching in an unstructured database is the same as brute-forcing a dataset of keys inside a cryptography symmetric algorithm. So, in the future, if the quantum wave rises, many...
