Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Introduction to Fault Analysis in Cryptography Kapitel lesen Erstes Kapitel lesen

2019 | OriginalPaper | Buchkapitel

3. Exploitable Fault Space Characterization: A Complementary Approach

verfasst von : Sayandeep Saha, Dirmanto Jap, Sikhar Patranabis, Debdeep Mukhopadhyay, Shivam Bhasin, Pallab Dasgupta

Erschienen in: Automated Methods in Cryptographic Fault Analysis

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Consider the problem of estimating the success rate of an attacker for a given fault location. Intuitively, the success rate indicates the likeliness of an attack for returning the key bits within a practical computational bound. It is a quantity worth estimating as it helps in choosing cipher constructs and sub-operations showing a certain amount of robustness against fault attacks. In this chapter, we present a framework, which can estimate quantities like success rate and can provide new insights into the cipher structures in the context of fault attacks. The main idea is to utilize the exact encoding of algebraic fault attacks (AFA) for exploring the fault space without getting affected by its prohibitive time complexity. We propose a machine learning (ML) based speedup strategy to make the AFA suitable for characterizing huge fault spaces statistically. This statistical approach is found to be extremely informative for cipher designers and evaluators.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel ExpFault: An Automated Framework for Block Cipher Fault Analysis
Nächstes Kapitel Differential Fault Analysis Automation on Assembly Code
Fußnoten
1
A block cipher is nothing but a Boolean function, and for every Boolean function, we can have such an algebraic representation. In fact, this representation is a normal form known as algebraic normal form (ANF).
 
2
In this chapter, we shall present a quantification of the fault space size. It is worth mentioning that ExpFault handles the fault space by means of abstraction, which makes the fault space exploration problem rather scalable.
 
3
The fault values and the plaintext values are not explicitly considered (i.e., abstracted) in ExpFault. The fault space size becomes relatively reasonable to be exhausted without these two parameters. The flip side of this abstraction is that ExpFault returns the best case attack complexity (from attacker’s perspective) for certain ciphers like PRESENT.
 
4
However, it is worth mentioning that, by assigning some of the correct key bits in the equation system, a cipher evaluator can also handle the cases where key extraction by means of a fault is partial.
 
Literatur
1.
N. Bagheri, R. Ebrahimpour, N. Ghaedi, New differential fault analysis on present. EURASIP J. Adv. Signal Process. 2013(1), 145 (2013)
2.
C. Beierle, J. Jean, S. Kölbl, G. Leander, A. Moradi, T. Peyrin, Y. Sasaki, P. Sasdrich, S.M. Sim, The SKINNY family of block ciphers and its low-latency variant MANTIS, in Annual Cryptology Conference (Springer, Berlin, 2016), pp. 123–153MATH
3.
E. Biham, R. Anderson, L. Knudsen, Serpent: a new block cipher proposal, in Proc. 5th Int. Workshop Fast Software Encryption (FSE) (Springer, Paris, 1998), pp. 222–238
4.
A. Bogdanov, L.R. Knudsen, G. Leander, C. Paar, A. Poschmann, M.J. Robshaw, Y. Seurin, C. Vikkelsoe, PRESENT: an ultra-lightweight block cipher, in Proceedings of the 9th International Workshop on Cryptographic Hardware and Embedded Systems, CHES ’07 (Springer, Berlin, 2007) pp. 450–466MATH
5.
6.
N.T. Courtois, K. Jackson, D. War, Fault-algebraic attacks on inner rounds of des, in e-Smart’10 Proceedings: The Future of Digital Security Technologies (Strategies Telecom and Multimedia, Montreuil, 2010)
7.
F. De Santis, O.M. Guillen, E. Sakic, G. Sigl, Ciphertext-only fault attacks on present, in International Workshop on Lightweight Cryptography for Security and Privacy (Springer, Cham, 2014), pp. 85–108MATH
8.
J.-C. Faugere, A. Joux, Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gröbner bases, in Proc. 23rd Annual Cryptology Conference (CRYPTO), vol. 2729 (Springer, Santa Barbara, 2003), pp. 44–60
9.
N.F. Ghalaty, B. Yuce, P. Schaumont, Differential fault intensity analysis on present and led block ciphers, in International Workshop on Constructive Side-Channel Analysis and Secure Design (Springer, Cham, 2015), pp. 174–188
10.
J. Guo, T. Peyrin, A. Poschmann, M. Robshaw, The LED block cipher, in Cryptographic Hardware and Embedded Systems—CHES 2011 (Springer, Berlin, 2011), pp. 326–341CrossRef
11.
E. Hsu, C. Muise, J. Beck, S. McIlraith, Probabilistically estimating backbones and variable bias: experimental overview, in Proc. 14th Int. Conf. Principles Practice Constraint Programming (CP) (Springer, Sydney, 2008), pp. 613–617
12.
F. Hutter, Y. Hamadi, H.H. Hoos, K. Leyton-Brown, Performance prediction and automated tuning of randomized and parametric algorithms, in Proc. 12th Int. Conf. Principles Practice Constraint Programming (CP), (Springer, Nantes, 2006), pp. 213–228
13.
F. Hutter, L. Xu, H.H. Hoos, K. Leyton-Brown, Algorithm runtime prediction: methods & evaluation. Artif. Intell. 206, 79–111 (2014)MathSciNetCrossRef
14.
P. Jovanovic, M. Kreuzer, I. Polian, An algebraic fault attack on the led block cipher. IACR Cryptology ePrint Archive 2012, 400 (2012)MATH
15.
P. Jovanovic, M. Kreuzer, I. Polian, A fault attack on the LED block cipher, in Proc. 3rd Int. Workshop Constructive Side-Channel Analysis Secure Design (COSADE), (Springer, Darmstadt, 2012), pp. 120–134
16.
P. Khanna, C. Rebeiro, A. Hazra, XFC: a framework for eXploitable fault characterization in block ciphers, in Proceedings of the 54th Annual Design Automation Conference 2017, DAC ’17 (ACM, New York, 2017), pp. 8:1–8:6
17.
K. Leyton-Brown, E. Nudelman, Y. Shoham, Empirical hardness models: methodology and a case study on combinatorial auctions. J. ACM 56(4), 22 (2009)
18.
W. Li, D. Gu, X. Xia, C. Zhao, Z. Liu, Y. Liu, Q. Wang, Single byte differential fault analysis on the LED lightweight cipher in the wireless sensor network. Int. J. Comput. Intell. Syst. 5(5), 896–904 (2012)CrossRef
19.
W. Li, W. Zhang, D. Gu, Y. Cao, Z. Tao, Z. Zhou, Y. Liu, Z. Liu, Impossible differential fault analysis on the LED lightweight cryptosystem in the vehicular ad-hoc networks. IEEE Trans. Dependable Sec. Comput. 13(1), 84–92 (2016)CrossRef
20.
L. Lobjois, M. Lemaître, Branch and bound algorithm selection by performance prediction, in Proc. 15th National Conf. AI, 10th Innovative Applications AI Conf. (AAAI/IAAI) (AAAI, Wisconsin, 1998), pp. 353–358
21.
P. Luo, K. Athanasiou, Y. Fei, T. Wahl, Algebraic fault analysis of sha-3, in Proc. 20th Design, Automation & Test in Europe Conference & Exhibition (DATE) (IEEE, Lausanne, Mar 2017), pp. 151–156
22.
D. Mitchell, B. Selman, H. Levesque, Hard and easy distributions of SAT problems, in Proc. 10th National Conf. AI (AAAI), vol. 92 (AAAI, San Jose, 1992), pp. 459–465
23.
E. Nudelman, K. Leyton-Brown, H.H. Hoos, A. Devkar, Y. Shoham, Understanding random SAT: beyond the clauses-to-variables ratio, in Proc. 10th Int. Conf. Principles Practice Constraint Programming (CP) (Springer, Toronto, 2004), pp. 438–452
24.
S. Saha, D. Jap, S. Patranabis, D. Mukhopadhyay, S. Bhasin, P. Dasgupta, Automatic characterization of exploitable faults: a machine learning approach. IEEE Trans. Inf. Forensics Secur. 14(4), 954–968 (2019)CrossRef
25.
M. Soos, K. Nohl, C. Castelluccia, Extending SAT solvers to cryptographic problems, in Proc. 12th Int. Conf. Theory Applications Satisfiability Testing (SAT) (Springer, Wales, 2009), pp. 244–257
26.
K.R. Varshney, A risk bound for ensemble classification with a reject option, in Proc. 14th IEEE Workshop Statistical Signal Process. (SSP) (IEEE, Nice, June 2011), pp. 769–772
27.
G. Wang, S. Wang, Differential fault analysis on PRESENT key schedule, in 2010 International Conference on Computational Intelligence and Security (CIS) (IEEE, Nanning, 2010), pp. 362–366
28.
L. Xu, F. Hutter, H.H. Hoos, K. Leyton-Brown, SATzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 32, 565–606 (2008)CrossRef
29.
F. Zhang, X. Zhao, S. Guo, T. Wang, Z. Shi. Improved algebraic fault analysis: a case study on piccolo and applications to other lightweight block ciphers, in Proc. 4th Int. Workshop Constructive Side-Channel Analysis Secure Design (COSADE) (Springer, Paris, 2013), pp. 62–79
30.
F. Zhang, S. Guo, X. Zhao, T. Wang, J. Yang, F.-X. Standaert, D. Gu. A framework for the analysis and evaluation of algebraic fault attacks on lightweight block ciphers. IEEE Trans. Inf. Forensics Secur. 11(5), 1039–1054 (2016)CrossRef
31.
X. Zhao, S. Guo, T. Wang, F. Zhang, Z. Shi. Fault-propagate pattern based DFA on PRESENT and PRINT cipher. Wuhan Univ. J. Nat. Sci. 17(6), 485–493 (2012)MathSciNetCrossRef
32.
X. Zhao, S. Guo, F. Zhang, Z. Shi, C. Ma, T. Wang, Improving and evaluating differential fault analysis on LED with algebraic techniques, in Proc. 10th IEEE Workshop Fault Diagnosis Tolerance Cryptogr. (FDTC) (IEEE, Santa Barbara, 2013), pp. 41–51
33.
G. Zhao, R. Li, L. Cheng, C. Li, B. Sun, Differential fault analysis on LED using Super-Sbox. IET Inform. Secur. 9(4), 209–218 (2014)CrossRef
Metadaten
Titel
Exploitable Fault Space Characterization: A Complementary Approach
verfasst von
Sayandeep Saha
Dirmanto Jap
Sikhar Patranabis
Debdeep Mukhopadhyay
Shivam Bhasin
Pallab Dasgupta
Copyright-Jahr
2019
Buch
Automated Methods in Cryptographic Fault Analysis

Print ISBN: 978-3-030-11332-2

Electronic ISBN: 978-3-030-11333-9

Copyright-Jahr: 2019

DOI
https://doi.org/10.1007/978-3-030-11333-9_3

Neuer Inhalt

    Bildnachweise