Acta Scientific Computer Sciences

Review Article Volume 3 Issue 9

Methods for DPA and Branch Prediction Side Channel Attack Mitigation

Siddharth Shankar Swain*

Department of Computer Sciences, BITS Pilani, Pilani Campus, India

*Corresponding Author: Siddharth Shankar Swain, Department of Computer Sciences, BITS Pilani, Pilani Campus, India.

Received: July 25, 2021; Published: August 05, 2021

Abstract

Differential power analysis side channel attacks uses the power consumed by different instructions when executed on a processor. Repeated experimentation by trying to encrypt the data with different keys. CPU instructions consume varying power, executes in varying lengths of time. Basic operation for any program executing on a processor involves switching of semiconductors. Semiconductors consume current while switching. Shape of this power consumption profile reveals activity. Comparison of these power profiles reveals processes happening and data consumed. There is also vulnerabilities in branch prediction [3] and speculative execution which is exploited by another class of side channel attacks. Our proposed solution directly acts at assembly instructions level, where we use the method of outlining to replace only the repeated sets of instructions with Turing complete instructions [1]. We replace the actual instructions with different Turing complete instructions to introduce randomness and also to eliminate the explicit jump or branch instructions. At the end we present a game theoretic approach to model such side channel attacks [2], with the aim to have a cost benefit analysis of these attacks and what should be the right approach for the user/defender in this zero sum-two player game.

Keywords: Differential Power Analysis; Branch Prediction Attacks; Turing Complete Instructions; Two Player Game

Bibliography

  1. https://www.cl.cam.ac.uk/sd601/papers/mov.pdfAPA:83
  2. Standaert Franois-Xavier. “Introduction to side-channel attacks”. Secure Integrated Circuits and Systems. Springer, Boston, MA (2010): 27-42.
  3. Aciimez Onur., et al. “On the power of simple branch prediction analysis”. Proceedings of the 2nd ACM symposium on Information, computer and communications security. ACM (2007).
  4. Kocher Paul C. “Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems”. Annual International Cryptology Conference. Springer, Berlin, Heidelberg (1996).
  5. Shamir Adi. “Protecting smart cards from passive power analysis with detached power supplies”. International Workshop on Cryptographic Hardware and Embedded Systems. Springer, Berlin, Heidelberg, (2000).
  6. Koruyeh Esmaeil Mohammadian., et al. “Speccfi: Mitigating spectre attacks using cfi informed speculation”. 2020 IEEE Symposium on Security and Privacy (SP). IEEE (2020).
  7. ADVANCED MICRO DEVICES, INC. Software techniques for managing speculation on and processors (2018).
  8. Ukkonen Esko. “On-line construction of suffix trees”. Algorithmica 3 (1995): 249-260.
  9. Nash John. “Non-cooperative games”. Annals of Mathematics2 (1951): 286-295.

Citation

Citation: Siddharth Shankar Swain. “Methods for DPA and Branch Prediction Side Channel Attack Mitigation". Acta Scientific Computer Sciences 3.9 (2021): 07-15.

Copyright

Copyright: © 2021 Siddharth Shankar Swain. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.




Metrics

Acceptance rate35%
Acceptance to publication20-30 days

Indexed In




News and Events


  • Certification for Review
    Acta Scientific certifies the Editors/reviewers for their review done towards the assigned articles of the respective journals.
  • Submission Timeline for Upcoming Issue
    The last date for submission of articles for regular Issues is December 25, 2024.
  • Publication Certificate
    Authors will be issued a "Publication Certificate" as a mark of appreciation for publishing their work.
  • Best Article of the Issue
    The Editors will elect one Best Article after each issue release. The authors of this article will be provided with a certificate of "Best Article of the Issue"

Contact US