Quick Navigation
Topics
Open Quantum Systems Decoherence
Quantum Generic Attacks on Feistel Schemes
arXiv
Authors: Hong Wang, Zhi Ma
Year
2010
Paper ID
10947
Status
Preprint
Abstract Read
~2 min
Abstract Words
78
Citations
N/A
Abstract
The Feistel scheme is an important structure in the block ciphers. The security of the Feistel scheme is related to distinguishability with a random permutation. In this paper, efficient quantum algorithms for distinguishing classical 3,4-round and unbalanced Feistel scheme with contracting functions from random permutation are proposed. Our algorithms realize an exponential speed-up over classical algorithms for these problems. Furthermore, the method presented in this paper can also be used to consider unbalanced Feistel schemes with expanding functions.
Why This Paper Matters
- This paper contributes to the Open Quantum Systems & Decoherence research area in the Quantum Articles archive.
- It adds a 2010 reference point for readers tracking recent quantum research.
- The Feistel scheme is an important structure in the block ciphers.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.