Parallel crypto-devices for GF(p) elliptic curve multiplication resistant against side channel attacks

All elliptic curve cryptographic schemes are based on scalar multiplication of points, and hence its faster computation signifies faster operation. This paper proposes two different parallelization techniques to speedup the GF(p) elliptic curve multiplication in affine coordinates and the corresponding architectures. The proposed implementations are capable of resisting different side channel attacks based on time and power analysis. The 160, 192, 224 and 256 bits implementations of both the architectures have been synthesized and simulated for both FPGA and 0.13μ CMOS ASIC. The final designs have been prototyped on a Xilinx Virtex-4 xc4vlx200-12ff1513 FPGA board and performance analyzes carried out. The experimental result and performance comparison show better throughput of the proposed implementations as compared to existing reported architectures.     

Differential fault analysis on Camellia

Camellia is a 128-bit block cipher published by NTT and Mitsubishi in 2000. On the basis of the byte-oriented model and the differential analysis principle, we propose a differential fault attack on the Camellia algorithm. Mathematical analysis and simulating experiments show that our attack can recover its 128-bit, 192-bit or 256-bit secret key by introducing 30 faulty ciphertexts. Thus our result in this study describes that Camellia is vulnerable to differential fault analysis. This work provides a new reference to the fault analysis of other block ciphers.     

Differential fault analysis on the ARIA algorithm

The ARIA algorithm is a Korean Standard block cipher, which is optimized for lightweight environments. On the basis of the byte-oriented model and the differential analysis principle, we propose a differential fault attack on the ARIA algorithm. Mathematical analysis and simulating experiment show that our attack can recover its 128-bit secret key by introducing 45 faulty ciphertexts. Simultaneously, we also present a fault detection technique for protecting ARIA against this proposed analysis. We believe that our results in this study will also be beneficial to the analysis and protection of the same type of other iterated block ciphers.     

Efficient elliptic curve scalar multiplication algorithms resistant to power analysis

This paper presents four algorithms for securing elliptic curve scalar multiplication against power analysis. The highest-weight binary form (HBF) of scalars and randomization are applied to resist power analysis. By using a special method to recode the scalars, the proposed algorithms do not suffer from simple power analysis (SPA). With the randomization of the secret scalar or base point, three of the four algorithms are secure against differential power analysis (DPA), refined power analysis (RPA) and zero-value point attacks (ZPA). The countermeasures are also immune to the doubling attack. Fast Shamir’s method is used in order to improve the efficiency of parallel scalar multiplication. Compared with previous countermeasures, the new countermeasures achieve higher security and do not impact overall performance.     

Differential fault analysis on the contracting UFN structure, with application to SMS4 and MacGuffin

The contracting unbalanced Feistel networks (UFN) is a particular structure in the block ciphers, where the “left half” and the “right half” are not of equal size, and the size of the domain of one half is larger than that of the range. This paper studies the security of the contracting UFN structure against differential fault analysis (DFA). We propose two basic byte-oriented fault models and two corresponding attacking methods. Then we implement the attack on two instances of the contracting UFN structure, the block ciphers SMS4 and MacGuffin. The experiments require 20 and 4 faulty ciphertexts to recover the 128-bit secret key of SMS4 in the two fault models, respectively. Under similar hypothesis, MacGuffin is breakable with 355 and 165 faulty ciphertexts, respectively. So our work not only builds up a general model of DFA on the contracting UFN structure and ciphers, but also provides a new reference for fault analysis on other block ciphers.     

Differential power and electromagnetic attacks on a FPGA implementation of elliptic curve cryptosystems

This paper describes the first differential power and electromagnetic analysis attacks performed on a hardware implementation of an elliptic curve cryptosystem. In the same time we also compared the metrics used in differential power and electromagnetic radiation attacks. We describe the use of the Pearson correlation coefficient, the distance of mean test and the maximum likelihood test. For each metric the number of measurements needed to get a clear idea of the right guess of the key-bit is taken as indication of the strength of the metric.     

素数域椭圆曲线密码系统算法实现研究

针对素数域椭圆曲线密码系统的算法高速实现,分别讨论了对椭圆曲线上的点的加法和倍点运算。以及对点的标量乘法运算进行优化的技术,同时给出了测试比较结果,说明了所讨论的优化技术可以大大提高整个椭圆曲线密码系统的算法实现性能。     

PRESENT相关功耗分析攻击研究

对PRESENT分组密码抗相关功耗分析能力进行了研究。基于汉明距离功耗模型,提出了一种针对PRESENT S盒的相关功耗分析方法,并通过仿真实验进行了验证。结果表明,未加防护措施的PRESENT硬件实现易遭受相关功耗分析威胁,5个样本的功耗曲线经分析即可恢复64位第一轮扩展密钥,将80位主密钥搜索空间降低到216,因此,PRESENT密码硬件实现需要对此类攻击进行防护。     

针对SM4的混合智能侧信道分析攻击方法

目前国内外针对SM4算法的传统侧信道分析攻击,由于计算量问题,采取将S盒隔离,逐个攻破的方式进行密钥恢复。该方式无法利用功耗曲线中与密钥相关的全部信息,造成信息浪费、所需实测功耗曲线数量多等问题。针对传统方式的局限性,提出一种针对SM4算法的混合智能侧信道分析攻击方法。该方法将SM4算法中的4个S盒视为一个整体,同时利用多个S盒的功耗泄露信息,通过PSO与GA相结合的混合算法快速搜索密钥。对传统和该方法进行密钥恢复对比实验,通过实验结果可知,恢复SM4算法S盒第一轮轮密钥传统分析方法需1 670条实测功耗曲线,而该方法仅需790条,验证该方法能够减少恢复SM4算法密钥所需实测功耗曲线数量,提高侧信道分析攻击效率。     

针对IDEA加密算法的差分功耗攻击

研究分析国际数据加密算法IDEA的特点,采用差分功耗分析攻击方式进行密钥破解,针对IDEA算法提出一种基于汉明距离的差分功耗攻击方法.该攻击方法是一种典型的加密芯片旁路攻击方式,其理论基础为集成电路中门电路在实现加密算法时的物理特性、功耗模型及数据功耗相关性.详细介绍了针对IDEA加密系统进行差分功耗攻击的设计与实现,开发了相应的仿真实验平台,实验成功破解了IDEA加密算法的密钥,从而给IDEA加密算法研究者提供了有益的安全设计参考.实验表明,未加防护措施的IDEA加密系统难以抵御差分功耗的攻击.     

基于带符号阶乘展开式的抗功耗方案算法

采用二进制编码的椭圆曲线密码抗功耗攻击方案往往效率较低。通过将标量表示成带符号的阶乘展开式编码形式,将标量乘法运算转化为一组小整数多标量乘法运算,结合预计算表的方法及基点掩码方法实施抗功耗攻击。根据算法性能分析结果表明,基于带符号阶乘展开式抗功耗攻击方案可以抵御多种功耗攻击,并且能够大幅提高计算效率。