TY - GEN
T1 - Cryptanalysis of Raindrop and FBC
AU - Ren, Bingqing
AU - Chen, Jiageng
AU - Zhou, Shihao
AU - Jin, Xiushu
AU - Xia, Zhe
AU - Liang, Kaitai
PY - 2019/1/1
Y1 - 2019/1/1
N2 - This paper introduces the results of several different security analysis of two new block ciphers: Raindrop and FBC, which are the two candidates of block cipher designs submitted to the Chinese Cryptographic Algorithms Design Competition in 2019. Raindrop applies two-branch Feistel structure, while FBC block cipher is based on the four-way dual Feistel structure design. We give detailed security evaluation on Raindrop and FBC, using differential, linear, impossible difference and boomerang cryptanalysis approaches. For Raindrop, we achieved the results as follows: differential attack on 12-round Raindrop based on the 11-round distinguisher with the computational complexity of 262.41; linear attack on 13-round Raindrop based on 12-round distinguisher with the computational complexity of 2106.3; impossible differential attack on 18-round Raindrop based on 12-round distinguisher with the computational complexity of 2102.83; and boomerang attack on 15-round Raindrop based on 14-round distinguisher with the computational complexity of 2224.6. For FBC, results are as follows: differential attack on 12-round FBC based on 11-round distinguisher with the computational complexity of 293.41; linear attack on 11-round FBC based on 10-round distinguisher with the computational complexity of 2112.54; impossible differential attack on 11-round FBC based on 7-round distinguisher with the computational complexity of 294-54; and boomerang attack on 13-round FBC based on 12-round distinguisher with the computational complexity of 2247.67. At present, the best records achieved are 18-round impossible differential attack for Raindrop-128-128 and 13-round boomerang attack for FBC128-256. The statistical distinguishers we built are similar to the proposals but we provide the concrete key recovery attacks in this study.
AB - This paper introduces the results of several different security analysis of two new block ciphers: Raindrop and FBC, which are the two candidates of block cipher designs submitted to the Chinese Cryptographic Algorithms Design Competition in 2019. Raindrop applies two-branch Feistel structure, while FBC block cipher is based on the four-way dual Feistel structure design. We give detailed security evaluation on Raindrop and FBC, using differential, linear, impossible difference and boomerang cryptanalysis approaches. For Raindrop, we achieved the results as follows: differential attack on 12-round Raindrop based on the 11-round distinguisher with the computational complexity of 262.41; linear attack on 13-round Raindrop based on 12-round distinguisher with the computational complexity of 2106.3; impossible differential attack on 18-round Raindrop based on 12-round distinguisher with the computational complexity of 2102.83; and boomerang attack on 15-round Raindrop based on 14-round distinguisher with the computational complexity of 2224.6. For FBC, results are as follows: differential attack on 12-round FBC based on 11-round distinguisher with the computational complexity of 293.41; linear attack on 11-round FBC based on 10-round distinguisher with the computational complexity of 2112.54; impossible differential attack on 11-round FBC based on 7-round distinguisher with the computational complexity of 294-54; and boomerang attack on 13-round FBC based on 12-round distinguisher with the computational complexity of 2247.67. At present, the best records achieved are 18-round impossible differential attack for Raindrop-128-128 and 13-round boomerang attack for FBC128-256. The statistical distinguishers we built are similar to the proposals but we provide the concrete key recovery attacks in this study.
KW - Boomerang cryptanalysis
KW - Differential cryptanalysis
KW - FBC
KW - Impossible difference cryptanalysis
KW - Linear cryptanalysis
KW - Raindrop
UR - http://www.scopus.com/inward/record.url?scp=85076953457&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-36938-5_33
DO - 10.1007/978-3-030-36938-5_33
M3 - Conference contribution
AN - SCOPUS:85076953457
SN - 9783030369378
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 536
EP - 551
BT - Network and System Security - 13th International Conference, NSS 2019, Proceedings
A2 - Liu, Joseph K.
A2 - Huang, Xinyi
PB - SpringerOpen
T2 - 13th International Conference on Network and System Security, NSS 2019
Y2 - 15 December 2019 through 18 December 2019
ER -