A new Digital Signature Algorithm based on Factorization and Discrete Logarithm problem
 | International Journal of Computer Trends and Technology (IJCTT) |  |
| © - Issue 2012 by IJCTT Journal | ||
| Volume-3 Issue-4 | ||
| Year of Publication : 2012 | ||
| Authors :Sushila Vishnoi, Vishal Shrivastava |
Sushila Vishnoi, Vishal Shrivastava"A new Digital Signature Algorithm based on Factorization and Discrete Logarithm problem"International Journal of Computer Trends and Technology (IJCTT),V3(4):510-513 Issue 2012 .ISSN 2231-2803.www.ijcttjournal.org. Published by Seventh Sense Research Group.
Abstract: -Generally, digital signature algorithms are based on a single hard problem like prime factorization problem, discrete logarithm problem, elliptic curve problem. If one finds solution of this single hard problem then these digital signature algorithms will no longer be secured and due to large computational power, this may be possible in future. There are many other algorithms which are based on the hybrid combination of prime factorization and discrete logarithms problem but different weaknesses and attacks have been developed against those algorithms. This paper also presents a new variant of digital signature algorithm which is based on two hard problems, prime factorization and discrete logarithm.
References-
[1]. D. Boneh and D. Brumley. Remote timing attacks are practical. Proceedings of 12th USENIX Security Symposium, 2003.
[2]. D. Boneh, G. Durfee, and Y. Frankel. Exposing an RSA private key given a small fraction of its bits. Full version of the work from Asiacrypt, 98, 1998. International Journal of Computer Trends and Technology- volume3Issue4- 2012
[3]. D. Boneh and H. Shacham. Fast variants of RSA. CryptoBytes (RSA Laboratories), 5:1-9, 2002.
[4]. B. De Weger. Cryptanalysis of RSA with small prime difference. Applicable Algebra in Engineering, Communication and Computing, 13(1):17-28, 2002.
[5]. W. Di_e and M. Hellman. New directions in cryptography. Information Theory, IEEE Transactions on, 22(6):644-654, 2002.
[6]. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. Information Theory, IEEE Transactions on, 31(4):469- 472, 2002.
[7]. D. M. Gordon. Discrete Logarithms in GF(P) Using the Number Field Sieve. SIAM Journal on Discrete Mathematics, 6(1):124-138, 1993.
Keywords-Digital Signature; Discrete logarithm; Factorization; Cryptanalysis.