On the Complexity of Attacking Commercial Authentication Products

Abstract In this paper we discuss the difficulties of mounting successful attacks against crypto implementations if essential information is missing. We start with a detailed description of our attack against our own design, to highlight which information is needed to increase the success of an attack, i.e. we use it as a blueprint to the following attack against commercially available crypto chips. We would like to stress that our attack against our own design is very similar to what happens during certification e.g. according to the Common Criteria Standard as in those cases the manufacturer needs to provide detailed information. If attacking commercial designs without signing NDAs, we were forced to intensively search the Internet for information about the designs. We were able to reveal information on the processing sequence during the authentication process even as detailed as identifying the clock cycles in which the individual key bits are processed. But we could not reveal the private keys used by the attacked commercial authentication chips 100% correctly. Moreover, as we did not knew the used keys we could not evaluate the success of our attack. To summarize, the effort of such an attack is significantly higher than the one of attacking a well-known implementation.

[1]  Nele Mentens,et al.  Side-channel evaluation of FPGA implementations of binary Edwards curves , 2010, 2010 17th IEEE International Conference on Electronics, Circuits and Systems.

[2]  B. L. Welch The generalisation of student's problems when several different population variances are involved. , 1947, Biometrika.

[3]  Zoya Dyka,et al.  On the Complexity of Attacking Commercial Authentication Products , 2019, 2019 10th IFIP International Conference on New Technologies, Mobility and Security (NTMS).

[4]  Dirk Fox,et al.  Digital Signature Standard (DSS) , 2001, Datenschutz und Datensicherheit.

[5]  Welch Bl THE GENERALIZATION OF ‘STUDENT'S’ PROBLEM WHEN SEVERAL DIFFERENT POPULATION VARLANCES ARE INVOLVED , 1947 .

[6]  Kouichi Itoh,et al.  Address-Bit Differential Power Analysis of Cryptographic Schemes OK-ECDH and OK-ECDSA , 2002, CHES.

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

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

[9]  Zoya Dyka,et al.  Methods increasing inherent resistance of ECC designs against horizontal attacks , 2020, Integr..

[10]  Zoya Dyka,et al.  Breaking a fully Balanced ASIC Coprocessor Implementing Complete Addition Formulas on Weierstrass Elliptic Curves , 2018, 2020 23rd Euromicro Conference on Digital System Design (DSD).

[11]  Kazuo Ohta,et al.  Improved countermeasure against Address-bit DPA for ECC scalar multiplication , 2010, 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010).

[12]  E. Darra,et al.  Cryptographic system for data applications, in the context of internet of things , 2020, Microprocess. Microsystems.

[13]  Zoya Dyka,et al.  Horizontal DPA Attacks against ECC: Impact of Implemented Field Multiplication Formula , 2019, 2019 14th International Conference on Design & Technology of Integrated Systems In Nanoscale Era (DTIS).

[14]  Kouichi Itoh,et al.  A Practical Countermeasure against Address-Bit Differential Power Analysis , 2003, CHES.

[15]  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).

[16]  N. Koblitz Elliptic curve cryptosystems , 1987 .

[17]  Zoya Dyka,et al.  Horizontal Attacks Against ECC: From Simulations to ASIC , 2019, IOSec/MSTEC/FINSEC@ESORICS.

[18]  Zoya Dyka,et al.  Horizontal SCA Attacks against $kP$ Algorithm Using K-Means and PCA , 2020, 2020 9th Mediterranean Conference on Embedded Computing (MECO).

[19]  Zoya Dyka,et al.  Methods for Increasing the Resistance of Cryptographic Designs Against Horizontal DPA Attacks , 2017, ICICS.

[20]  Zoya Dyka,et al.  Intelligent Clustering as a Means to Improve K-means Based Horizontal Attacks , 2019, 2019 IEEE 30th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC Workshops).

[21]  Zoya Dyka,et al.  FPGA Implementation of ECC: Low-Cost Countermeasure against Horizontal Bus and Address-Bit SCA , 2018, 2018 International Conference on ReConFigurable Computing and FPGAs (ReConFig).

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