DocumentCode
3062371
Title
Fast Quantum Algorithms of Breaking the Data Encryption Standard
Author
Chang, Weng-Long
Author_Institution
Dept. of Comput. Sci. & Inf. Eng., Nat. Kaohsiung Univ. of Appl. Sci., Kaohsiung, Taiwan
fYear
2010
fDate
6-9 Sept. 2010
Firstpage
520
Lastpage
527
Abstract
It is shown that the time complexity of breaking Data Encryption Standard is O(56) Hadamard gates, O(262272) NOT gates, O(10482) CNOT gates, O(458880) CCNOT gates, O(1) Shor´s quantum order-finding algorithm, and O(1) measurement, and the space complexity of breaking Data Encryption Standard is O(3367) quantum bits.
Keywords
computational complexity; cryptography; quantum computing; CCNOT gates; CNOT gates; Hadamard gates; NOT gates; data encryption standard; fast quantum algorithms; quantum order finding algorithm; space complexity; time complexity; Encryption; IP networks; Logic gates; Quantum computing; Registers; Schedules; Wire; Data Encryption Standard; Quantum Algorithm; Quantum Circuits;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing with Applications (ISPA), 2010 International Symposium on
Conference_Location
Taipei
Print_ISBN
978-1-4244-8095-1
Electronic_ISBN
978-0-7695-4190-7
Type
conf
DOI
10.1109/ISPA.2010.27
Filename
5634375
Link To Document