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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Biernat, J., & Nikodem, M. (2005). Fault cryptanalysis of ElGamal signature scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3643 LNCS, pp. 327–336). https://doi.org/10.1007/11556985_43
Mendeley helps you to discover research relevant for your work.