Alternative Equations for Guillou-Quisquater Signature Scheme

Full Text (PDF, 418KB), PP.27-33

Views: 0 Downloads: 0

Author(s)

J. Ettanfouhi 1,* O. Khadir 1

1. Laboratory of Mathematics, Cryptography and Mechanics, Fstm, University Hassan II of Casablanca, Morocco

* Corresponding author.

DOI: https://doi.org/10.5815/ijcnis.2016.09.04

Received: 6 Nov. 2015 / Revised: 11 Feb. 2016 / Accepted: 25 Apr. 2016 / Published: 8 Sep. 2016

Index Terms

Public key cryptography, RSA, Guillou-Quisquater signature scheme

Abstract

In 1990, Guillou and Quisquater published an article where they described a new digital signature system. Their technique was based on the RSA algorithm. In this paper, we present several modified Guillou-Quisquater digital signature protocols. We discuss their security and complexity. These schemes can be seen as alternative signature methods if existing systems are completely broken.

Cite This Paper

J. Ettanfouhi, O. Khadir, "Alternative Equations for Guillou-Quisquater Signature Scheme", International Journal of Computer Network and Information Security(IJCNIS), Vol.8, No.9, pp.27-33, 2016. DOI:10.5815/ijcnis.2016.09.04

Reference

[1]R. R. Ahmad, E. S. Ismail,and N. M. F. Tahat, A new digital signature scheme based on factoring and discrete logarithms, J. of Mathematics and Statistics (4): (2008), pp. 222-225.
[2]J. Buchmann, Introduction to Cryptography,(Second Edition), Springer (2000).
[3]W.Diffie and M.E.Hellman, New directions in cryptography, IEEE Transactions on information theory, vol. IT-22,(1976), pp. 644-654..
[4]T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithm problem, IEEE Trans. Info. Theory, IT-31, (1985), 469 - 472.
[5]L.C. Guillou, J.J. Quisquater, A Paradoxial Identity-based SIgnature Scheme Resulting from Zero-Knowledge, Advances in cryptography, LNCS 403, (1990) pp. 216-231.
[6]A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, Handbook of applied cryptography, CRC Press, Boca Raton, Florida, (1997).
[7]H. Ong, C .P . Schnorr and A. Shamir, Efficient signature schemes on polynomial equations, Advances in Cryptology, Crypto’84, LNCS 196, Springer-Verlag, (1985), 37 - 46.
[8]M. O. Rabin, Digitalized signatures and public key functions as intractable as factoring, MIT/LCS/TR, Vol. 212, (1979).
[9]R. Rivest, A. Shamir and L. Adeleman, A method for obtaining digital signatures and public key cryptosystems, Communication of the ACM, Vol. no 21, (1978), pp. 120-126.
[10]C. P. Schnorr, Efficient signatures generation by smart cards, Advances in Cryptology, Crypto’89, LNCS 435, Springer-Verlag, (1990), 239 - 252.
[11]A. Shamir, How to prove yourself : practical solutions to identification and signature problems, Advances in Cryptology, Crypto’86, LNCS 196, Springer-Verlag, (1987), 186 - 194.
[12]D. R. Stinson, Cryptography, theory and practice, Third Edition, Chapman & Hall/CRC, (2006).
[13]D.P. Franco, F.D. Barboza, N. M. Cardoso, A Secure Method for Authenticity Verification of Handwritten Signatures Through Digital Image Processing and Artificial Neural Networks, International Journal of Communication Networks and Information Security (IJCNIS), Vol 5, No 2 (2013).
[14]H. TOUMI, A. TALEA, B. MARZAK, A. EDDAOUI, M. TALEA, Cooperative Trust Framework for Cloud Computing Based on Mobile Agents, International Journal of Communication Networks and Information Security (IJCNIS), Vol 7, No 2 (2015).