A construction method of digital signature scheme based on the discrete logarit combining finding root problem on Zp
Abstract: 112
| 
PDF: 103 
##plugins.themes.academic_pro.article.main##
Author
Keywords:
Digital signature
Digital signature algorithm
Signature Digital Scheme (DSS
Discrete Logarithm Problem (DLP)
Finding Root Problem (FRP)
Abstract
The digital signature schemes (DSSes) are based on some well investigated hard computational problems. The most efficient known DSSes are based on the following three difficult problems: 1). Factorization of a composite number n = p.q, where p and q are two large primes; 2). Finding discrete logarithm modulo large prime number Zp; 3). Finding discrete logarithm in a group of points of some elliptic curve. The paper proposes building a digital signature scheme based on the difficulty of the discrete logarithm combining finding root problem on Zp,.This problem is a new difficult problem type, the problems class without mathematical solution. Building a digital signature scheme based on the difficulty of the discrete logarithm combining finding root problem allows us to improve the security of the algorithm.
References
-
[1] R.L. Rivest, A. Shamir, and L.M. Adleman. A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Communications of the ACM, 1978, vol. 21, no 2, pp. 120–126.
[2] Rabin M.O. Digitalized Signatures and Public Key Functions as Intractable as Factorization. - Technical report MIT/LCS/TR-212, MIT Laboratory for Computer Science, 1979.
[3] ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory. 1985, Vol. IT-31, No. 4. pp.469–472.
[4] Schnorr C.P. Efficient signature generation by smart cards. J. Cryptology. 1991. vol. 4. pp. 161–174.
[5] National Institute of Standards and Technology, NIST FIPS PUB 186. Digital Signature Standard, U.S. Department of Commerce, 1994.
[6] GOST R 34.10-94. Russian Federation Standard. Information Technology. Cryptographic data Security. Produce and check procedures of Electronic Digital Signature based on Asymmetric Cryptographic Algorithm. Government Committee of the Russia for Standards, 1994 (in Russian).
[7] ANSI X9.62 and FIPS 186-2. Elliptic curve signature algorithm, 1998.
[8] GOST R 34.10-2001. Russian Federation Standard. Information Technology. Cryptographic data Security. Produce and check procedures of Electronic Digital Signature. Government Committee of the Russia for Standards, 2001 (in Russian).
[9] Nguyen Duc Thuy and Luu Hong Dung, “A New Construction Method of Digital Signature Algorithms”, IJCSNS International Journal of Computer Science and Network Security. Vol. 16 No. 12 pp. 53-57, December 2016. ISSN: 1738 - 7906.
[10] Q. X. WU, Y. X. Yang and Z. M. HU, "New signature schemes based on discrete logarithms and factoring", Journal of Beijing University of Posts and Telecommunications, vol. 24, pp. 61-65, January 2001.
[11] Z. Y. Shen and X. Y. Yu, "Digital signature scheme based on discrete logarithms and factoring", Information Technology, vol. 28, pp. 21-22, June 2004.
[12] Shimin Wei, “Digital Signature Scheme Based on Two Hard Problems”, IJCSNS International Journal of Computer Science and Network Security, VOL.7 No.12, December 2007.
[13] Eddie Shahrie Ismail, Tahat N.M.F., Rokiah. R. Ahmad, “A New Digital Signature Scheme Based on Factoring and Discrete Logarithms”, Journal of Mathematics and Statistics, 04/2008; 12(3). DOI: 10.3844/jmssp.2008.222.225 Source:DOAJ.
[14] Qin Yanlin, Wu Xiaoping, “New Digital Signature Scheme Based on both ECDLP and IFP”, Computer Science and Information Technology, 2009. ICCSIT 2009. 2nd IEEE International Conference on, 8-11 Aug. 2009, E-ISBN: 978-1-4244-4520-2, pp 348 - 351.
[15] Swati Verma1, Birendra Kumar Sharma, “A New Digital Signature Scheme Based on Two Hard Problems”, International Journal of Pure and Applied Sciences and Technology, ISSN 2229 – 6107, Int. J. Pure Appl. Sci. Technol., 5(2) (2011), pp. 55-59.
[16] Sushila Vishnoi, Vishal Shrivastava, “A new Digital Signature Algorithm based on Factorization and Discrete Logarithm problem”, International Journal of Computer Trends and Technology, volume 3, Issue 4, 2012.
[17] A.N. Berezin, N.A. Moldovyan, V.A. Shcherbacov, "Cryptoschemes Based on Difficulty of Simultaneous Solving Two Different Difficult Problems", Computer Science Journal of Moldova, vol.21, no.2(62), 2013.
[18] N.A. Moldovyan, "Digital Signature Scheme Based on a New Hard Problem", Computer Science Journal of Moldova, vol.16, no.2(47), 2008
Read more
##plugins.themes.academic_pro.article.sidebar##
Published
Jul 31, 2019
Download
How to Cite
Nguyen Duc Thuy, Bui Tat Hieu, Luu Hong Dung. “A Construction Method of Digital Signature Scheme Based on the Discrete Logarit Combining Finding Root Problem on Zp”. The University of Danang - Journal of Science and Technology, vol. 17, no. 7, July 2019, pp. 40-44, https://jst-ud.vn/jst-ud/article/view/2059.
