Paper 2024/1217

A Compact and Parallel Swap-Based Shuffler based on butterfly Network and its complexity against Side Channel Analysis

Jong-Yeon Park, Samsung (South Korea)
Wonil Lee, Samsung (South Korea)
Bo Gyeong Kang
Il-jong Song, Samsung (South Korea)
Jaekeun Oh, Samsung (South Korea)
Kouichi Sakurai, Kyushu University
Abstract

A prominent countermeasure against side channel attacks, the hiding countermeasure, typically involves shuffling operations using a permutation algorithm. Especially in the era of Post-Quantum Cryptography, the importance of the hiding coun- termeasure is emphasized due to computational characteristics like those of lattice and code-based cryptography. In this context, swiftly and securely generating permutations has a critical impact on an algorithmโ€™s security and efficiency. The widely adopted Fisher-Yates shuffle, because of its high security and ease of implementation, is prevalent. However, it has a limitation of complexity O(๐‘) due to its sequential nature. In response, we propose a time-area trade-off swap algorithm, FSS, based on the Butterfly Network with only log(๐‘) depth, log(๐‘) works and O(1) operation time in parallel. We will calculate the maximum gain that an attacker can achieve through butterfly operations with only log(๐‘) depth from side channel analysis perspective. In particular, we will show that it is possible to derive a generalized formula of the attack complexity with higher-order side channel attacks for arbitrary input sizes through a fractal structure of the butterfly network. Furthermore, our research highlights the possibility of generating efficient and secure permutations utilizing a minimal amount of randomness.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
Keywords
permutationshufflingBenes NetworkSide channel attackPost quantum cryptography
Contact author(s)
pjy8499 @ gmail com
History
2024-07-31: approved
2024-07-30: received
See all versions
Short URL
https://ia.cr/2024/1217
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2024/1217,
      author = {Jong-Yeon Park and Wonil Lee and Bo Gyeong Kang and Il-jong Song and Jaekeun Oh and Kouichi Sakurai},
      title = {A Compact and Parallel Swap-Based Shuffler based on butterfly Network and its complexity against Side Channel Analysis},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1217},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1217}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.