Paper Info
Title
Quantum Chosen-Ciphertext Attacks against Feistel Ciphers.
Abstract
Seminal results by Luby and Rackoff show that the 3-round Feistel cipher is secure against chosen-plaintext attacks (CPAs), and the 4-round version is secure against chosen-ciphertext attacks (CCAs). However, the security significantly changes when we consider attacks in the quantum setting, where the adversary can make superposition queries. By using Simon’s algorithm that detects a secret cycle-period in polynomial-time, Kuwakado and Morii showed that the 3-round version is insecure against quantum CPA by presenting a polynomial-time distinguisher. Since then, Simon’s algorithm has been heavily used against various symmetric-key constructions. However, its applications are still not fully explored.
Year
DOI
Venue
2019
10.1007/978-3-030-12612-4_20
IACR Cryptology ePrint Archive
DocType
Volume
Citations 
Conference
2018
0
PageRank 
References 
Authors
0.34
17
5
Name
Order
Citations
PageRank
Gembu Ito100.68
Akinori Hosoyamada202.70
Ryutaroh Matsumoto329135.73
Yu Sasaki424715.33
Tetsu Iwata554550.28