State-Recovery Attacks On Modified Ketje Jr

In this article we study the security of the authenticated encryption algorithm KETJE against divide-and-conquer attacks. KETJE is a third-round candidate in the ongoing CAESAR competition, which shares most of its design principles with the SHA-3 hash function. Several versions of KETJE have been submitted, with different sizes for its internal state. We describe several state-recovery attacks on the smaller variant, called KETJE JR. We show that if one increases the amount of keystream output after each round from 16 bits to 40 bits, KETJE JR becomes vulnerable to divide-and-conquer attacks with time complexities 2(71)(.5) for the original version and 2(82.3) for the current tweaked version, both with a key of 96 bits. We also propose a similar attack when considering rates of 32 bits for the non-tweaked version. Our findings do not threaten the security of KETJE, but should be taken as a warning against potential future modifications that would aim at increasing the performance of the algorithm.