Paper Info
Title
Cryptanalysis of ForkAES.
Abstract
Forkciphers are a new kind of primitive proposed recently by Andreeva et al. for efficient encryption and authentication of small messages. They fork the middle state of a cipher and encrypt it twice under two smaller independent permutations. Thus, forkciphers produce two output blocks in one primitive call. Andreeva et al. proposed ForkAES, a tweakable AES-based forkcipher that splits the state after five out of ten rounds. While their authenticated encrypted schemes were accompanied by proofs, the security discussion for ForkAES was not provided, and founded on existing results on the AES and KIASU-BC. Forkciphers provide a unique interface called reconstruction queries that use one ciphertext block as input and compute the respective other ciphertext block. Thus, they deserve a careful security analysis. This work fosters the understanding of the security of ForkAES with three contributions: (1) We observe that security in reconstruction queries differs strongly from the existing results on the AES. This allows to attack nine out of ten rounds with differential, impossible-differential and yoyo attacks. (2) We observe that some forkcipher modes may lack the interface of reconstruction queries, so that attackers must use encryption queries. We show that nine rounds can still be attacked with rectangle and impossible-differential attacks. (3) We present forgery attacks on the AE modes proposed by Andreeva et al. with nine-round ForkAES.
Year
DOI
Venue
2019
10.1007/978-3-030-21568-2_3
Lecture Notes in Computer Science
Keywords
DocType
Volume
Symmetric-key cryptography,Cryptanalysis,Tweakable block cipher,Impossible differential,Boomerang,Yoyo,AE
Conference
11464
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
0
9
Name
Order
Citations
PageRank
Subhadeep Banik121824.91
Jannis Bossert200.68
Amit Jana300.68
Eik List411113.70
Stefan Lucks51083108.87
Willi Meier6155.73
Mostafizar Rahman700.68
Dhiman Saha85712.12
Yu Sasaki951251.79