Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 53482 (05)
- University: Sharif University of Technology
- Department: Electrical Engineering
- Advisor(s): Eghlidos, Taraneh
- Abstract:
- Quantum computers can be used to process complex computations much more efficient than their classical counterparts. Cryptanalysis of classical ciphers is no exception to this rule. Most quantum cryptanalysis of symmetric ciphers is based on finding the periodicity, linear structure, and confidential information of the target algorithm. In this thesis, assuming that the attacker has access to the quantum computer, we propose a quantum method for deriving the appropriate differential characteristic of block ciphers, using Simon's quantum algorithm. It is worth noting that, unlike classical methods, where increasing the number of rounds of the target block cipher increases the complexity of the attack exponentially, the time complexity of quantum cryptanalysis methods is independent of the number of rounds of the target algorithm, but only applies to a subset of key space. Compared to similar existing works, namely Xie's, the time complexity of our proposed method is a constant multiple of the number of input bits of the target algorithm. This is while Xie's method, as the only existing quantum method, has a complexity of polynomial order in terms of the number of input bits. However, the required memory of our method is of O(n) Qbit, similar to Xie's algorithm, where n is the number of output bits of the block cipher. Besides, this method can also be used for truncated differential cryptanalysis of the target block cipher
- Keywords:
- Differential Cryptoanalysis ; Quantum Algorithm ; Simon's Algorithm ; Block Cipher ; Quantum Cryptography ; Quantum Processing ; Bernstein-Vazirani's Quantum Algorithm ; Symmetric Ciphers
Digital Object List
-
محتواي کتاب
- view
Bookmark