Fully Parallel, One-Cycle Random Shuffling for Efficient Countermeasure Against Side Channel Attack and Its Complexity Verification

Abstract

Hiding countermeasures are the most widely utilized techniques for thwarting side-channel attacks. Commonly, the Fisher-Yates algorithm is adopted in hiding countermeasures with permuted operation for its security and efficiency in implementation, yet the inherently sequential nature of the algorithm imposes limitations on hardware acceleration. In this work, we propose a novel method named Addition Round Rotation ($\mathsf {ARR}$), which can introduce a time-area trade-off with block-based permutation. Our findings indicate that this approach can achieve a permutation brute force complexity level ranging from $2^{128}$, with the modified version achieving up to $2^{288}$ in a single clock cycle, while maintaining substantial resistance against second-order analysis. To substantiate the security of our proposed method, we introduce a new validation technique – Identity Verification. This technique allows theoretical validation of the proposed algorithm’s security and is consistent with the experimental results. Finally, we introduce an actual hardware design and provide the implementation results on Application-Specific Integrated Circuit (ASIC). The measured performance demonstrates that our proposal fully supports the practical applicability.