Using SAT Solving to Improve Differential Fault Analysis of Trivium

Mohamed, Mohamed Saied Emam; Bulygin, Stanislav; Buchmann, Johannes

doi:10.1007/978-3-642-23141-4_7

Cited by 28 publications

(23 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The basic idea of AFA is to convert both the cipher and the injected faults into algebraic equations and recover the secret key with automated solvers such as SAT instead of the manual analysis on fault propagations in DFA, hence making it easier to extend AFA to deep rounds and different ciphers and fault models. AFA has been successfully used to improve DFA on the stream ciphers such as Trivium [19] and Grain [20] and block ciphers such as AES [21], LED [22,23], KASUMI [24], and Piccolo [25].…”

Section: Security and Communication Networkmentioning

confidence: 99%

See 1 more Smart Citation

Stealthy Hardware Trojan Based Algebraic Fault Analysis of HIGHT Block Cipher

Chen

Wang

Zhang

et al. 2017

Security and Communication Networks

View full text Add to dashboard Cite

HIGHT is a lightweight block cipher which has been adopted as a standard block cipher. In this paper, we present a bit-level algebraic fault analysis (AFA) of HIGHT, where the faults are perturbed by a stealthy HT. The fault model in our attack assumes that the adversary is able to insert a HT that flips a specific bit of a certain intermediate word of the cipher once the HT is activated. The HT is realized by merely 4 registers and with an extremely low activation rate of about 0.000025. We show that the optimal location for inserting the designed HT can be efficiently determined by AFA in advance. Finally, a method is proposed to represent the cipher and the injected faults with a merged set of algebraic equations and the master key can be recovered by solving the merged equation system with an SAT solver. Our attack, which fully recovers the secret master key of the cipher in 12572.26 seconds, requires three times of activation on the designed HT. To the best of our knowledge, this is the first Trojan attack on HIGHT.

show abstract

Section: Security and Communication Networkmentioning

confidence: 99%

“…Our aim is to fully recover the entire master key, which is mainly depending on solving the two equations (19) and (20) in Section 4. Our task is to investigate the number of queries ( , ) and (0, ) to solve the equations.…”

Section: Data Complexity Analysismentioning

confidence: 99%

Stealthy Hardware Trojan Based Algebraic Fault Analysis of HIGHT Block Cipher

Chen

Wang

Zhang

et al. 2017

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…22 9248. 13 Table 4. Results of our attack using only a one-bit fault injection Table 4 reports our experiments.…”

Section: Resultsmentioning

confidence: 99%

“…As a result, we present a more practical algebraic differential fault attack called Mutant DFA (MDFA). Specifically, instead of addressing the gathered DFA information with just one particular algebraic technique as suggested in [11] and [13], we combine several algebraic techniques. In this way we benefit from the advantages of each individual technique.…”

Section: Our Contributionmentioning

confidence: 99%

“…Afterwards, in [13] an improvement to the Hojsík and Rudolf attack was presented using SAT-solver techniques instead of classical linear algebra. The idea of this approach consists in translating the additional DFA information together with the algebraic representation of Trivium into the satisfiability problem and then using a SAT technique to solve the underlying problem.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Mutant Differential Fault Analysis of Trivium MDFA

Mohamed

Buchmann

2015

Information Security and Cryptology - ICISC 2014

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper we present improvements to the differential fault analysis (DFA) of the stream cipher Trivium proposed in the work of M. Hojsík and B. Rudolf. In particular, we optimize the algebraic representation of obtained DFA information applying the concept of Mutants, which represent low degree equations derived after processing of DFA information. As a result, we are able to minimize the number of fault injections necessary for retrieving the secret key. Therefore, we introduce a new algebraic framework that combines the power of different algebraic techniques for handling additional information received from a physical attack. Using this framework, we are able to recover the secret key by only an one-bit fault injection. In fact, this is the first attack on stream ciphers utilizing minimal amount of DFA information. We study the efficiency of our improved attack by comparing the size of gathered DFA information with previous attacks.

show abstract

A survey of lightweight stream ciphers for embedded systems

Manifavas

Hatzivasilis

Fysarakis

et al. 2015

Security Comm. Networks

View full text Add to dashboard Cite

Pervasive computing constitutes a growing trend, aiming to embed smart devices into everyday objects. The limited resources of these devices and the ever‐present need for lower production costs, lead to the research and development of lightweight cryptographic mechanisms. Block ciphers, the main symmetric key cryptosystems, perform well in this field. Nevertheless, stream ciphers are also relevant in ubiquitous computing applications, as they can be used to secure the communication in applications where the plaintext length is either unknown or continuous, like network streams. This paper provides the latest survey of stream ciphers for embedded systems. Lightweight implementations of stream ciphers in embedded hardware and software are examined as well as relevant authenticated encryption schemes. Their speed and simplicity enable compact and low‐power implementations, allow them to excel in applications pertaining to resource‐constrained devices. The outcomes of the International Organization for Standardization/International Electrotechnical Commission 29192‐3 standard and the cryptographic competitions eSTREAM and Competition for Authenticated Encryption: Security, Applicability, and Robustness are summarized along with the latest results in the field. However, cryptanalysis has proven many of these schemes are actually insecure. From the 31 designs that are examined, only six of them have been found to be secure by independent cryptanalysis. A constrained benchmark analysis is performed on low‐cost embedded hardware and software platforms. The most appropriate and secure solutions are then mapped in different types of applications. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

Using SAT Solving to Improve Differential Fault Analysis of Trivium

Abstract: Abstract

Cited by 28 publications

References 9 publications

Stealthy Hardware Trojan Based Algebraic Fault Analysis of HIGHT Block Cipher

Stealthy Hardware Trojan Based Algebraic Fault Analysis of HIGHT Block Cipher

Mutant Differential Fault Analysis of Trivium MDFA

A survey of lightweight stream ciphers for embedded systems

Contact Info

Product

Resources

About