Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Efficient Fault Detection Architectures for Modular Exponentiation Targeting Cryptographic Applications Benchmarked on FPGAs (2402.18033v1)

Published 28 Feb 2024 in cs.CR

Abstract: Whether stemming from malicious intent or natural occurrences, faults and errors can significantly undermine the reliability of any architecture. In response to this challenge, fault detection assumes a pivotal role in ensuring the secure deployment of cryptosystems. Even when a cryptosystem boasts mathematical security, its practical implementation may remain susceptible to exploitation through side-channel attacks. In this paper, we propose a lightweight fault detection architecture tailored for modular exponentiation, a building block of numerous cryptographic applications spanning from classical cryptography to post quantum cryptography. Based on our simulation and implementation results on ARM Cortex-A72 processor, and AMD/Xilinx Zynq Ultrascale+, and Artix-7 FPGAs, our approach achieves an error detection rate close to 100%, all while introducing a modest computational overhead of approximately 7% and area overhead of less than 1% compared to the unprotected architecture. To the best of our knowledge, such an approach benchmarked on ARM processor and FPGA has not been proposed and assessed to date.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (23)
  1. Y. Zhou and D. Feng, “Side-Channel attacks: Ten years after its publication and the impacts on cryptographic module security testing,” IACR Cryptology ePrint Archive, vol. 2005, pp. 1–388, 2005.
  2. M. A. Vosoughi and S. Kose, “Combined distinguishers to enhance the accuracy and success of side channel analysis,” in Proc. IEEE Int. Symp. Circuits Syst. (ISCAS), May 2019, pp. 1–5.
  3. D. Boneh, R. A. DeMillo, and R. J. Lipton, “On the importance of checking cryptographic protocols for faults,” in Proc. Int. Conf. Theory Appl. Cryptograph. Techn., vol. 1233, 1997, pp. 37–51.
  4. D. Boneh, R. DeMillo, and R. Lipton, “On the importance of eliminating errors in cryptographic computations,” J. Cryptology, vol. 14, pp. 101-119, 2001.
  5. A. Barenghi, L. Breveglieri, I. Koren, and D. Naccache, “Fault injection attacks on cryptographic devices: Theory, practice, and countermeasures,” in Proc. IEEE, vol. 100, no. 11, pp. 3056–3076, Nov. 2012.
  6. M. Mozaffari Kermani and A. Reyhani-Masoleh, “Concurrent structure independent fault detection schemes for the Advanced Encryption Standard,” IEEE Trans. Comput., vol. 59, no. 5, pp. 608–622, May 2010.
  7. M. Bedoui, H. Mestiri, B. Bouallegue, and M. Machhout, “A reliable fault detection scheme for the AES hardware implementation,” in Proc. Int. Symp. Signal, Image, Video Commun. (ISIVC), Nov. 2016, pp. 47–52.
  8. M. Ciet and M. Joye, “Practical fault countermeasures for Chinese remaindering based RSA (extended abstract),” in Proc. Workshop Fault Detection Tolerance Cryptography, 2005, pp. 124–131.
  9. T. C. Koylu, C. R. W. Reinbrecht, S. Hamdioui, and M. Taouil, “RNN-based detection of fault attacks on RSA,” in Proc. IEEE Int. Symp. Circuits Syst. (ISCAS), Oct. 2020, pp. 1–5.
  10. A. Dominguez-Oviedo and M. Hasan, “Error detection and fault tolerance in ECSM using input randomization,” IEEE Trans. Dependable Secure Comput., vol. 6, no. 3, pp. 175–187, Jul.–Sep. 2009.
  11. K. Ahmadi, S. Aghapour, M. M. Kermani, and R. Azarderakhsh, “Efficient error detection schemes for ECSM window method benchmarked on FPGAs,” IEEE Trans. Very Large Scale Integr (VLSI) Syst, doi: 10.1109/TVLSI.2023.3341147, 2024.
  12. K. Ahmadi, S. Aghapour, M. Mozaffari Kermani, and R. Azarderakhsh, “Error detection schemes for τ-NAF conversion within Koblitz curves benchmarked on various ARM processors,” TechRxiv. Preprint. https://doi.org/10.36227/techrxiv.24168654.v1, 2023.
  13. P. W. Shor, “Algorithms for quantum computation: Discrete logarithms and factoring,” in Proc. 35th Annu. Symp. Found. Comput. Sci., 1994.
  14. N. Bindel, J. Krmer, and J. Schreiber, “Special session: hampering fault attacks against lattice-based signature schemes - countermeasures and their efficiency,” In Proc. IEEE Int. Conf. Hardware/Software Codesign. and Sys. Synt. pp. 1-3, 2017.
  15. A. Sarker, A. C. Canto, M. Mozaffari Kermani, and R. Azarderakhsh, “Error detection architectures for hardware/software co-design approaches of number-theoretic transform,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 42, no. 7, pp. 2418–2422, Jul. 2023.
  16. J. Howe, A. Khalid, M. Martinoli, F. Regazzoni, and E. Oswald, “Fault attack countermeasures for error samplers in lattice based cryptography,” in Proc. IEEE Int. Symp. Circuits Syst. (ISCAS), 2019, pp. 1–5.
  17. M. R. K. Ariffin, N. A. Abu, T. L. S. Chien, Z. Mahad, L. M. Cheon, A. H. A. Ghafar, and N. A. S. A. Jamal, “Kriptografi Atasi Zarah digital signature (KAZ-SIGN)”. Accessed: Sep. 25, 2023. [Online]. Available: https://www.antrapol.com/KAZ-SIGN.
  18. G. Fumaroli and D. Vigilant, “Blinded fault resistant exponentiation,” in Proc. Int. Workshop Fault Diagnosis Tolerance Cryptography, 2006, pp. 62–70.
  19. C. H. Kim and J.-J. Quisquater, “How can we overcome both side channel analysis and fault attacks on RSA-CRT?” in Proc. Workshop Fault Diagnosis Tolerance Cryptography, Sep. 2007, pp. 21–29.
  20. A. Boscher, H. Handschuh, and E. Trichina, “Blinded fault resistant exponentiation revisited,” in Proc. Workshop Fault Diagnosis Tolerance Cryptography, Sep. 2009, pp. 3–9.
  21. A. J. Menezes, P. C. van Oorschot, and S.A. Vanstone, “Handbook of applied cryptography,” CRC Press, 1997. [online]. Available: https://cacr.uwaterloo.ca/hac/.
  22. The GNU Multiple Precision Arithmetic Library (GMP). [Online]. Available: https://gmplib.org/.
  23. D. Terpstra, H. Jagode, H. You, and J. Dongarra, “Collecting performance data with PAPI-C,” in Proc. Tools for High Performance Computing. Springer, 2010.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com