Because of its strong leakage characterization ability and high key-recovery efficiency, Template Attack (TA) is the strongest side channel attack from the information theoretic point-of-view. In light of this, TA can be used as a powerful tool to evaluate the security of a crypto device in real scenarios. In fact, by evaluating the key-recovery efficiency of TA, the security of a crypto device can be quantified. Therefore, it is very meaningful to optimize the key-recovery efficiency of TA in real scenarios. In this work, we show that the leakage exploitation style can significantly influence the key-recovery efficiency of TA. In detail, rather than exploiting the leakage of the noise part, the leakage of the squared noise part can be used in TA. Theoretically, by exploiting the leakage of the squared noise part, the key-recovery efficiency of TA can be optimized under the normalized difference metric. Empirically, with the evaluation data provided by DPA Contest and ASCAD, the key-recovery efficiency of TA can be optimized under the success rate metric. Overall, this contribution may help one to accurately evaluate the security of a crypto device in real scenarios.
Information is pivotal in contemporary society, highlighting the necessity for a secure cryptographic system. The emergence of quantum algorithms and the swift advancement of specialized quantum computers will render traditional cryptography susceptible to quantum attacks in the foreseeable future. The lattice-based Saber key encapsulation protocol holds significant value in cryptographic research and practical applications. In this paper, we propose three types of polynomial multipliers for various application scenarios including lightweight Schoolbook multiplier, high-throughput multiplier based on the TMVP-Schoolbook algorithm and improved pipelined NTT multiplier. Other principal modules of Saber are designed encompassing the hash function module, sampling module and functional submodule. Based on our proposed multiplier, we implement the overall hardware circuits of the Saber key encapsulation protocol. Experimental results demonstrate that our overall hardware circuits have different advantages. Our lightweight implementation has minimal resource consumption. Our high-throughput implementation only needs 23.28 s to complete the whole process, which is the fastest among the existing works. The throughput rate is 10,988 Kbps and the frequency is 416 MHz. Our hardware implementation based on the improved pipelined NTT multiplier achieved a good balance between area and performance. The overall frequency can reach 357 MHz.
The attack price of higher order side channel attacks (HOSCA) grows exponentially with the mask order. When the mask order is larger than 3, HOSCA can be inapplicable. In light of this, the distance similarity measure based profiling attack (DSMPA) is proposed. In DSMPA, the leakage property of masks can be characterised in a profiling scenario and the so called templates can be obtained. Then, DSM can be used to recover mask values with templates. With mask values recovered, the effect of masking disappears and one can use first‐order side‐channel attacks to recover the secret key used by a masked chip. The key‐recovery efficiency of DSMPA is evaluated in real scenarios, and the advantage of DSMPA over HOSCA in terms of the key‐recovery efficiency can be obvious under the success rate metric. Overall, the contribution of this work may provide evaluators a powerful tool to evaluate the security of masked chips.