By introducing collision information into divide-and-conquer attacks, several existing works transform the original candidate space, which may be too large to enumerate, into a significantly smaller collision space, thus making key recovery possible. However, the inefficient collision detection algorithms and fault tolerance mechanisms make them time-consuming and their success rate low. Moreover, they may still leave very huge chain spaces that makes it difficult for key recovery. In this article, we exploit collision attack to optimize Template Attack (TA), and propose a Lightweight Collision Detection (LCD) algorithm. The proposed method exploits a jump detection mechanism to efficiently reduce the repetitive collision detections on chains with the same prefix sub-chains. We then introduce guessing theory to reorder the collision detection of the sub-keys according to their guessing lengths, and provide us with an evaluation tool. Finally, we design a highly efficient fault tolerance mechanism for our LCD to allow flexible thresholds adjustment, and further optimize sieving mechanism to efficiently extract the best chains with the largest number of collisions. Experimental results fully demonstrate LCD's superiority.

中文翻译：

---

一种针对碰撞优化的分而治之攻击的轻量级检测算法

通过在分而治之攻击中引入碰撞信息，现有的一些工作将可能太大而无法枚举的原始候选空间转换为一个明显更小的碰撞空间，从而使密钥恢复成为可能。然而，低效的碰撞检测算法和容错机制使得它们耗时且成功率低。而且，它们仍然可能留下非常巨大的链空间，这使得密钥恢复变得困难。在本文中，我们利用碰撞攻击来优化模板攻击（TA），并提出轻量级碰撞检测（LCD）算法。所提出的方法利用跳跃检测机制来有效减少具有相同前缀子链的链上的重复碰撞检测。然后我们引入猜测理论，根据子密钥的猜测长度重新排序子密钥的碰撞检测，并为我们提供评估工具。最后，我们为我们的 LCD 设计了一个高效的容错机制，允许灵活的阈值调整，并进一步优化筛选机制，以有效地提取碰撞次数最多的最佳链。实验结果充分证明了LCD的优越性。