Paper 2023/1889

Fully Parallel, One-Cycle Random Shuffling for Efficient Countermeasure in Post-Quantum Cryptography

Jong-Yeon Park, Samsung (South Korea)
Dongsoo Lee, Samsung (South Korea)
Seonggyeom Kim, Samsung (South Korea)
Wonil lee, Samsung (South Korea)
Bo Gyeong Kang, Samsung (South Korea)
Kouichi Sakurai, Kyushu University

Hiding countermeasures are the most widely utilized techniques for thwarting side-channel attacks, and their significance has been further emphasized with the advent of Post Quantum Cryptography (PQC) algorithms, owing to the extensive use of vector operations. 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 ARR, which can introduce a time-area trade-off with block-based permutation. Our findings indicate that this approach can achieve a permutation complexity level commensurate with or exceeding $2^{128}$ 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.

Note: This work has been submitted to the IEEE for possible publication. Copyright may be transferred, after which this version may no longer be accessible.

Available format(s)
Publication info
Contact author(s)
pjy8499 @ gmail com
dsdsdsds lee @ samsung com
sgyeom kim @ samsung com
wonil01 lee @ samsung com
bogyeong kang @ samsung com
sakurai @ inf kyushu-u ac jp
2023-12-21: revised
2023-12-08: received
See all versions
Short URL
Creative Commons Attribution


      author = {Jong-Yeon Park and Dongsoo Lee and Seonggyeom Kim and Wonil lee and Bo Gyeong Kang and Kouichi Sakurai},
      title = {Fully Parallel, One-Cycle Random Shuffling for Efficient Countermeasure in Post-Quantum Cryptography},
      howpublished = {Cryptology ePrint Archive, Paper 2023/1889},
      year = {2023},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.