TU Darmstadt / ULB / TUbiblio

Using SAT Solving to Improve Differential Fault Analysis of Trivium

Mohamed, Mohamed Saied Emam and Bulygin, Stanislav and Buchmann, Johannes
Kim, Tai-Hoon and Adeli, Hojjat and Robles, Rosslin John and Balitanas, Maricel (eds.) (2011):
Using SAT Solving to Improve Differential Fault Analysis of Trivium.
In: Proceedings of "The 5th International Conference on Information Security and Assurance" ISA 2011, Springer, Brno, Czech Republic, In: Communications in Computer and Information Science, DOI: 10.1007/978-3-642-23141-4_7, [Conference or Workshop Item]

Abstract

Combining different cryptanalytic methods to attack a cryptosystem became one of the hot topics in cryptanalysis. In particular, algebraic methods in side channel and differential fault analysis (DFA) attracted a lot of attention recently. In 2008, Hojsik and Rudolf used DFA to recover the inner state of the stream cipher Trivium which leads to recovering the secret key. For this attack, they required 3.2 one-bit fault injections on average and 800 keystream bits. In this paper, we give an example of combining DFA attacks and algebraic attacks. We use algebraic methods to improve the DFA of Trivium by Hojsik and Rudolf. Our improved DFA attack recovers the inner state of Trivium by using only 2 fault injections and only 420 keystream bits.

Item Type: Conference or Workshop Item
Erschienen: 2011
Editors: Kim, Tai-Hoon and Adeli, Hojjat and Robles, Rosslin John and Balitanas, Maricel
Creators: Mohamed, Mohamed Saied Emam and Bulygin, Stanislav and Buchmann, Johannes
Title: Using SAT Solving to Improve Differential Fault Analysis of Trivium
Language: ["languages_typename_1" not defined]
Abstract:

Combining different cryptanalytic methods to attack a cryptosystem became one of the hot topics in cryptanalysis. In particular, algebraic methods in side channel and differential fault analysis (DFA) attracted a lot of attention recently. In 2008, Hojsik and Rudolf used DFA to recover the inner state of the stream cipher Trivium which leads to recovering the secret key. For this attack, they required 3.2 one-bit fault injections on average and 800 keystream bits. In this paper, we give an example of combining DFA attacks and algebraic attacks. We use algebraic methods to improve the DFA of Trivium by Hojsik and Rudolf. Our improved DFA attack recovers the inner state of Trivium by using only 2 fault injections and only 420 keystream bits.

Title of Book: Proceedings of "The 5th International Conference on Information Security and Assurance" ISA 2011
Series Name: Communications in Computer and Information Science
Volume: 200
Publisher: Springer
Uncontrolled Keywords: Secure Data;Differential Fault Analysis, algebraic attack, SAT-Solvers,
Divisions: LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra
20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra > Cryptanalysis and Side Channel Attacks (CSCA)
LOEWE > LOEWE-Zentren
20 Department of Computer Science
LOEWE
Event Location: Brno, Czech Republic
Date Deposited: 30 Dec 2016 20:23
DOI: 10.1007/978-3-642-23141-4_7
Identification Number: TUD-CS-2011-0128
Export:

Optionen (nur für Redakteure)

View Item View Item