Toward reverse engineering on secret S-boxes in block ciphers

Tang, Ming; Qiu, Zhenlong; Peng, Hongbo; Hu, Xiaobo Sharon; Mu, Yi; Zhang, Huanguo

doi:10.1007/s11432-013-5053-9

Cited by 1 publication

(2 citation statements)

References 15 publications

(40 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The carry reduction procedure can be summarized by (8). The details of the procedure are shown in Figure 4.…”

Section: Byte-by-byte Recovery Of Primementioning

confidence: 99%

“…The attack methods can extract the secret cryptographic key or intermediate values, including power consumption, electromagnetic emissions, timing, or faults collected from a running cryptographic device, by using statistical tools operating on side channel leakages. Many studies have provided practical attack results on embedded devices [6][7][8]. Recently, papers have been published that describe attack procedures on specific PKC schemes implemented on PCs [9][10][11] and mobile phones [12,13].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Similar operation template attack on RSA-CRT as a case study

Zhang

et al. 2018

Sci. China Inf. Sci.

View full text Add to dashboard Cite

A template attack, the most powerful side-channel attack methods, usually first builds the leakage profiles from a controlled profiling device, and then uses these profiles to recover the secret of the target device. It is based on the fact that the profiling device shares similar leakage characteristics with the target device. In this study, we focus on the similar operations in a single device and propose a new variant of the template attack, called the similar operation template attack (SOTA). SOTA builds the models on public variables (e.g., input/output) and recovers the values of the secret variables that leak similar to the public variables. SOTA's advantage is that it can avoid the requirement of an additional profiling device. In this study, the proposed SOTA method is applied to a straightforward RSA-CRT implementation. Because the leakage is (almost) the same in similar operations, we reduce the security of RSA-CRT to a hidden multiplier problem (HMP) over GF(q), which can be solved byte-wise using our proposed heuristic algorithm. The effectiveness of our proposed method is verified as an entire prime recovery procedure in a practical leakage scenario.

show abstract

“…The carry reduction procedure can be summarized by (8). The details of the procedure are shown in Figure 4.…”

Section: Byte-by-byte Recovery Of Primementioning

confidence: 99%