Grover's algorithm is a quantum algorithm for unstructured search that finds the unique input to a black box function with high probability using O({\sqrt {N}}) evaluations, where N is the size of the domain. It provides a quadratic speedup over classical algorithms and can be used to speed up broad classes of algorithms. It could potentially brute-force a 128-bit symmetric cryptographic key in 264 iterations.

Stanford University

Winter 2023

This course offers an introduction to cryptographic techniques used in computer security, covering encryption, message integrity, digital signatures, key management, and more. It is suitable for advanced undergraduates and masters students with some proof techniques and programming experience.

No concepts data

+ 55 more concepts