Methods for Increasing the Resistance of Cryptographic Designs Against Horizontal DPA Attacks

Side channel analysis attacks, especially horizontal DPA and DEMA attacks, are significant threats for cryptographic designs. In this paper we investigate to which extend different multiplication formulae and randomization of the field multiplier increase the resistance of an ECC design against horizontal attacks. We implemented a randomized sequence of the calculation of partial products for the field multiplication in order to increase the security features of the field multiplier. Additionally, we use the partial polynomial multiplier itself as a kind of countermeasure against DPA attacks. We demonstrate that the implemented classical multiplication formula can increase the inherent resistance of the whole ECC design. We also investigate the impact of the combination of these two approaches. For the evaluation we synthesized all these designs for a 250 nm gate library technologies, and analysed the simulated power traces. All investigated protection means help to decrease the success rate of attacks significantly: the correctness of the revealed key was decreased from 99% to 69%.

[1]  P. L. Montgomery.  Speeding the Pollard and elliptic curve methods of factorization , 1987 .

[2]  Christian Wittke,et al.  Clockwise Randomization of the Observable Behaviour of Crypto ASICs to Counter Side Channel Attacks , 2015, 2015 Euromicro Conference on Digital System Design.

[3]  Sorin A. Huss,et al.  Procedures for Securing ECC Implementations Against Differential Power Analysis Using Reconfigurable Architectures , 2010, Dynamically Reconfigurable Systems.

[4]  Alfred Menezes,et al.  Software Implementation of Elliptic Curve Cryptography over Binary Fields , 2000, CHES.

[5]  Zoya Dyka,et al.  Evaluation of resistance of ECC designs protected by different randomization countermeasures against horizontal DPA attacks , 2017, 2017 IEEE East-West Design & Test Symposium (EWDTS).

[6]  Zoya Dyka,et al.  Horizontal address-bit DPA against montgomery kP implementation , 2017, 2017 International Conference on ReConFigurable Computing and FPGAs (ReConFig).

[7]  Zoya Dyka,et al.  Inherent Resistance of Efficient ECC Designs against SCA Attacks , 2016, 2016 8th IFIP International Conference on New Technologies, Mobility and Security (NTMS).

[8]  Zoya Dyka,et al.  Area efficient hardware implementation of elliptic curve cryptography by iteratively applying Karatsuba's method , 2005, Design, Automation and Test in Europe.

[9]  Christophe Clavier,et al.  Horizontal Correlation Analysis on Exponentiation , 2010, ICICS.

[10]  Shirley M. Radack.  Updated Digital Signature Standard Approved as Federal Information Processing Standard (FIPS)186-3 | NIST , 2009 .

[11]  F. Madlener,et al.  Novel hardening techniques against differential power analysis for multiplication in GF(2n) , 2009, 2009 International Conference on Field-Programmable Technology.

[12]  Éliane Jaulmes,et al.  Horizontal Collision Correlation Attack on Elliptic Curves , 2013, Selected Areas in Cryptography.

[13]  Ricardo Dahab,et al.  Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation , 1999, CHES.

[14]  Alfred Menezes,et al.  The Elliptic Curve Digital Signature Algorithm (ECDSA) , 2001, International Journal of Information Security.

[15]  Jean-Sébastien Coron,et al.  Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems , 1999, CHES.