A Multiple Sieve Approach Based on Artificial Intelligent Techniques and Correlation Power Analysis

2021 ◽  
Vol 17 (2s) ◽  
pp. 1-21
Author(s):  
Yaoling Ding ◽  
Liehuang Zhu ◽  
An Wang ◽  
Yuan Li ◽  
Yongjuan Wang ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Success Rate ◽  
Power Analysis ◽  
Premature Convergence ◽  
Side Channel ◽  
Side Channel Analysis ◽  
Simple Genetic Algorithm ◽  
Enumeration Algorithms ◽  
Channel Analysis ◽  
Correlation Power Analysis

Side-channel analysis achieves key recovery by analyzing physical signals generated during the operation of cryptographic devices. Power consumption is one kind of these signals and can be regarded as a multimedia form. In recent years, many artificial intelligence technologies have been combined with classical side-channel analysis methods to improve the efficiency and accuracy. A simple genetic algorithm was employed in Correlation Power Analysis (CPA) when apply to cryptographic algorithms implemented in parallel. However, premature convergence caused failure in recovering the whole key, especially when plenty of large S-boxes were employed in the target primitive, such as in the case of AES. In this article, we investigate the reason of premature convergence and propose a Multiple Sieve Method (MS-CPA), which overcomes this problem and reduces the number of traces required in correlation power analysis. Our method can be adjusted to combine with key enumeration algorithms and further improves the efficiency. Simulation experimental results depict that our method reduces the required number of traces by and , compared to classic CPA and the Simple-Genetic-Algorithm-based CPA (SGA-CPA), respectively, when the success rate is fixed to . Real experiments performed on SAKURA-G confirm that the number of traces required for recovering the correct key in our method is almost equal to the minimum number that makes the correlation coefficients of correct keys stand out from the wrong ones and is much less than the numbers of traces required in CPA and SGA-CPA. When combining with key enumeration algorithms, our method has better performance. For the traces number being 200 (noise standard deviation ), the attacks success rate of our method is , which is much higher than the classic CPA with key enumeration ( success rate). Moreover, we adjust our method to work on that DPA contest v1 dataset and achieve a better result (40.04 traces) than the winning proposal (42.42 traces).

scholarly journals Cryptanalysis of Chaos-Based Cryptosystem from the Hardware Perspective

2018 ◽  
Vol 28 (09) ◽  
pp. 1850114 ◽  
Author(s):  
Yuling Luo ◽  
Dezheng Zhang ◽  
Junxiu Liu ◽  
Yunqi Liu ◽  
Yi Cao ◽  
...  
Keyword(s):  
Power Analysis ◽  
Statistical Tests ◽  
Security Evaluation ◽  
Side Channel ◽  
Security Issue ◽  
Side Channel Analysis ◽  
Channel Information ◽  
Cryptographic System ◽  
Channel Analysis ◽  
Correlation Power Analysis

Chaos has been used in cryptography for years and many chaotic cryptographic systems have been proposed. Their securities are often evaluated by conducting conventional statistical tests, however few studies have referred to the security issue of the chaotic hardware cryptographic systems. This paper evaluates the security of the chaotic cryptographic system from a hardware perspective by using the side channel analysis attack. First, a chaotic block cryptosystem is designed and implemented based on an Atmel microcontroller. Then the conventional statistical security tests, including SP 800-22 test, characters frequency test, avalanche test, are used to verify its security performance. In the meantime, the correlation power analysis attack is carried out for the security evaluation. Experimental results demonstrate that even though the chaotic cryptographic system can pass the conventional statistical tests, it still has the probability to be attacked from a hardware perspective using the leaked side channel information such as execution time and power consumption. This paper proposes another way to analyze the security of the chaotic cryptosystem, which can aid designing mechanisms to enhance the security of the hardware cryptosystems in the future.

scholarly journals Key Bit-Dependent Side-Channel Attacks on Protected Binary Scalar Multiplication †

2018 ◽  
Vol 8 (11) ◽  
pp. 2168 ◽  
Author(s):  
Bo-Yeon Sim ◽  
Junki Kang ◽  
Dong-Guk Han
Keyword(s):  
Success Rate ◽  
Electromagnetic Emission ◽  
Scalar Multiplication ◽  
Statistical Characteristics ◽  
Side Channel ◽  
Secret Key ◽  
Side Channel Analysis ◽  
Software Implementations ◽  
Channel Analysis ◽  
Single Trace

Binary scalar multiplication, which is the main operation of elliptic curve cryptography, is vulnerable to side-channel analysis. It is especially vulnerable to side-channel analysis using power consumption and electromagnetic emission patterns. Thus, various countermeasures have been reported. However, they focused on eliminating patterns of conditional branches, statistical characteristics according to intermediate values, or data inter-relationships. Even though secret scalar bits are directly loaded during the check phase, countermeasures for this phase have not been considered. Therefore, in this paper, we show that there is side-channel leakage associated with secret scalar bit values. We experimented with hardware and software implementations, and experiments were focused on the Montgomery–López–Dahab ladder algorithm protected by scalar randomization in hardware implementations. We show that we could extract secret key bits with a 100% success rate using a single trace. Moreover, our attack did not require sophisticated preprocessing and could defeat existing countermeasures using a single trace. We focused on the key bit identification functions of mbedTLS and OpenSSL in software implementations. The success rate was over 94%, so brute-force attacks could still be able to recover the whole secret scalar bits. We propose a countermeasure and demonstrate experimentally that it can be effectively applied.

scholarly journals RFA: R-Squared Fitting Analysis Model for Power Attack

2017 ◽  
Vol 2017 ◽  
pp. 1-8
Author(s):  
An Wang ◽  
Yu Zhang ◽  
Liehuang Zhu ◽  
Weina Tian ◽  
Rixin Xu ◽  
...  
Keyword(s):  
Correlation Analysis ◽  
Success Rate ◽  
Time Complexity ◽  
Power Analysis ◽  
Side Channel ◽  
Analysis Model ◽  
Nonlinear Correlation ◽  
Important Method ◽  
Correlation Power Analysis ◽  
Fitting Model

Correlation Power Analysis (CPA) introduced by Brier et al. in 2004 is an important method in the side-channel attack and it enables the attacker to use less cost to derive secret or private keys with efficiency over the last decade. In this paper, we propose R-squared fitting model analysis (RFA) which is more appropriate for nonlinear correlation analysis. This model can also be applied to other side-channel methods such as second-order CPA and collision-correlation power attack. Our experiments show that the RFA-based attacks bring significant advantages in both time complexity and success rate.

scholarly journals ISAP – Towards Side-Channel Secure Authenticated Encryption

2017 ◽  
pp. 80-105 ◽  
Author(s):  
Christoph Dobraunig ◽  
Maria Eichlseder ◽  
Stefan Mangard ◽  
Florian Mendel ◽  
Thomas Unterluggauer
Keyword(s):  
Power Analysis ◽  
Side Channel ◽  
Authenticated Encryption ◽  
Session Key ◽  
Bulk Storage ◽  
Side Channel Analysis ◽  
Encryption Schemes ◽  
Secret Keys ◽  
Shared Secret ◽  
Channel Analysis

Side-channel attacks and in particular differential power analysis (DPA) attacks pose a serious threat to cryptographic implementations. One approach to counteract such attacks are cryptographic schemes based on fresh re-keying. In settings of pre-shared secret keys, such schemes render DPA attacks infeasible by deriving session keys and by ensuring that the attacker cannot collect side-channel leakage on the session key during cryptographic operations with different inputs. While these schemes can be applied to secure standard communication settings, current re-keying approaches are unable to provide protection in settings where the same input needs to be processed multiple times. In this work, we therefore adapt the re-keying approach and present a symmetric authenticated encryption scheme that is secure against DPA attacks and that does not have such a usage restriction. This means that our scheme fully complies with the requirements given in the CAESAR call and hence, can be used like other noncebased authenticated encryption schemes without loss of side-channel protection. Its resistance against side-channel analysis is highly relevant for several applications in practice, like bulk storage settings in general and the protection of FPGA bitfiles and firmware images in particular.

Sign in / Sign up

Export Citation Format

Share Document