Working Paper Article Version 1 This version is not peer-reviewed

Threats to Modern Cryptography: Grover’s Algorithm

Version 1 : Received: 22 September 2020 / Approved: 27 September 2020 / Online: 27 September 2020 (11:48:32 CEST)

How to cite: Mina-Zicu, M.; Simion, E. Threats to Modern Cryptography: Grover’s Algorithm. Preprints 2020, 2020090677 Mina-Zicu, M.; Simion, E. Threats to Modern Cryptography: Grover’s Algorithm. Preprints 2020, 2020090677

Abstract

Information security plays a major role in the dynamics of today’s interconnected world. Despite the successful implementation and effectiveness of modern cryptographic techniques, their inherent limitations can be exploited by quantum computers. In this article we discuss Grover’s quantum searching algorithm and its impact on the security of modern symmetric ciphers. More specifically, we present its formal description and give an implementation of the algorithm using IBM’s Qiskit framework, which allows us to simulate and run the program on a real device. The developed program is modular and scalable, managing to properly run on any input state. We compare the performance of the algorithm running on the local simulator against its execution on a quantum processor from IBM’s lineup, noting the discrepancies between the results due to physical characteristics of the chip.

Subject Areas

Grover’s algorithm; information security; quantum computation; Qiskit; symmetric cipher

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.