Fault Cryptanalysis of ElGamal Signature Scheme

  • Janusz Biernat
  • Maciej Nikodem
Conference paper

DOI: 10.1007/11556985_43

Volume 3643 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Biernat J., Nikodem M. (2005) Fault Cryptanalysis of ElGamal Signature Scheme. In: Moreno Díaz R., Pichler F., Quesada Arencibia A. (eds) Computer Aided Systems Theory – EUROCAST 2005. EUROCAST 2005. Lecture Notes in Computer Science, vol 3643. Springer, Berlin, Heidelberg

Abstract

In this paper we examine the immunity of ElGamal signature scheme and its variants against fault cryptanalysis. Although such schemes have been already widely adopted, their resistance against fault cryptanalysis has not been verified in detail yet. However, at least some of them are not immune to fault cryptanalysis and can be broken without solving discrete logarithm problem. We will show that the selected signature schemes can be broken in O(nlog2n) steps if single bit-flip errors are inducted during computations. We also present two modifications that can be used to improve security of ElGamal scheme.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Janusz Biernat
    • 1
  • Maciej Nikodem
    • 1
  1. 1.Institute of Engineering CyberneticsWrocław University of TechnologyWrocławPoland