Date of Award
2018
Document Type
Dissertation
Publication Status
Version of Record
Submission Date
October 2026
Thesis/Dissertation Advisor [Chair]
Steinwandt, Rainer
Abstract
Quantum computers and quantum computing is a reality of the near feature. Companies such as Google and IBM have already declared they have built a quantum computer and tend to increase their size and capacity moving forward. Quantum computers have the ability to be exponentially more powerful than classical computers today. With this power modeling behavior of atoms or chemical reactions in unusual conditions, improving weather forecasts and traffic conditions become possible. Also, their ability to exponentially speed up some computations makes the security of todays data and items a major concern and interest. In the area of cryptography, some encryption schemes (such as RSA) are already deemed broken by the onset of quantum computing. Some encryption algorithms have already been created to be quantum secure and still more are being created each day. While these algorithms in use today are considered quantum-safe not much is known of what a quantum attack would look like on these algorithms. Specifically, this paper discusses how many quantum bits, quantum gates and even the depth of these gates that would be needed for such an attack. The research below was completed to shed light on these areas and offer some concrete numbers of such an attack.
Extent
54 p.
Recommended Citation
Langenberg, Brandon Wade, "Quantum Circuits for Symmetric Cryptanalysis" (2018). Electronic Theses and Dissertations 2010 - 2019. 1997.
https://digitalcommons.fau.edu/etd_general_6/1997
Identifier
FA00013010
Comments
Includes bibliography.|Dissertation (Ph.D.)--Florida Atlantic University, 2018.|FAU Electronic Theses and Dissertations Collection|Includes bibliography.