A Chosen-Plaintext Method of CPA on SM4 Block Cipher
Weijun Shan, Lihui Wang, Qing Li, Limin Guo, Shanshan Liu, Zhimin Zhang
Abstract
Weijun Shan, Lihui Wang, Qing Li, Limin Guo, Shanshan Liu, Zhimin Zhang
Abstract
In this paper, we will present a chosen-plaintext method of CPA on SM4 block cipher. This attack consists of a chosen-plaintext method and a transformed CPA attack. The chosen-plaintext method is used to decrease the computation complexity to guess the round register value and the transformed CPA attack is introduced to improve the effect of CPA attack. We accomplished hardware implement on Sasebo-Gii and power analysis, whose result proved that it takes 5000 traces to recover the key successfully by our method, while the normal CPA method needs 270000 traces.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we will present a chosen-plaintext method of CPA on SM4 block cipher. This attack consists of a chosen-plaintext method and a transformed CPA attack. The chosen-plaintext method is used to decrease the computation complexity to guess the round register value and the transformed CPA attack is introduced to improve the effect of CPA attack. We accomplished hardware implement on Sasebo-Gii and power analysis, whose result proved that it takes 5000 traces to recover the key successfully by our method, while the normal CPA method needs 270000 traces.
Key concepts: Plaintext, Block cipher, Computer science, Block (permutation group theory), Arithmetic, Algorithm, Theoretical computer science, Cryptography