State-of-the-art of secure ECC implementations: a survey on known side-channel attacks and countermeasures
- 1 June 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 76-87
Abstract
Implementations of cryptographic primitives are vulnerable to physical attacks. While the adversary only needs to succeed in one out of many attack methods, the designers have to consider all the known attacks, whenever applicable to their system, simultaneously. Thus, keeping an organized, complete and up-to-date table of physical attacks and countermeasures is of paramount importance to system designers. This paper summarizes known physical attacks and countermeasures on Elliptic Curve Cryptosystems. Instead of repeating the details of different attacks, we focus on a systematic way of organizing and understanding known attacks and countermeasures. Three principles of selecting countermeasures to thwart multiple attacks are given. This paper can be used as a road map for countermeasure selection in a first design iteration.Keywords
This publication has 23 references indexed in Scilit:
- The Carry Leakage on the Randomized Exponent Countermeasure2008
- Differential power and electromagnetic attacks on a FPGA implementation of elliptic curve cryptosystemsComputers and Electrical Engineering, 2007
- How to Prevent DPA and Fault Attack in a Unified Way for ECC Scalar Multiplication – Ring Extension Method2007
- Provably Secure Countermeasure Resistant to Several Types of Power Attack for ECCLecture Notes in Computer Science, 2007
- Elliptic Curve Cryptosystems in the Presence of Permanent and Transient FaultsDesigns, Codes and Cryptography, 2005
- Low-cost solutions for preventing simple side-channel analysis: side-channel atomicityIEEE Transactions on Computers, 2004
- Simple Power Analysis of Unified Code for ECC Double and AddLecture Notes in Computer Science, 2004
- Checking before output may not be enough against fault-based cryptanalysisIEEE Transactions on Computers, 2000
- Generalised fast algorithm for computing multiplicative inverses in GF (2 m )Electronics Letters, 1989
- Speeding the Pollard and elliptic curve methods of factorizationMathematics of Computation, 1987