Proposing a solution to keep the order of the generating element secret to enhance the security of the digital signature scheme
1 viewDOI:
https://doi.org/10.54939/1859-1043.j.mst.110.2026.150-158Keywords:
Hash function; Discrete logarithmic problem; New digital signature scheme.Abstract
Publicising the order of the generating element can sometimes cause a security risk for a digital signature scheme. Our proposed solution is a new digital signature scheme, in which the order of the generating element is kept secret. So, the proposed new digital signature scheme is more secure than the variants of the same type of digital signature scheme. Furthermore, the speed of computing of our scheme is faster than that of some similar schemes. For this reason, it can be applied in practice.
References
[1]. Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone, “Handbook Applied Cryptography”, Webster Professor of Electrical Engineering and Computer Science Massachusetts Institute of Technology, (1996).
[2]. B. Yang, “A DSA-Based and Efficient Scheme for Preventing IP Prefix Hijacking”, International Conference on Management of e-Commerce and e-Government, Shanghai, 87–92, (2014).
[3]. Binh V, Minh H. Nguyen, Nikolay A. Moldovyan, “Digital Signature Schemes from Two Hard Problems”, Multimedia and Ubiquitous Engineering, Springer, Dordrecht, 817–825, (2013).
[4]. Chik How Tan, Xun Yi, Chee Kheong Siew, “Signature scheme based on composite discrete logarithm”, Fourth International Conference on Information, Communications and Signal Processing and the Fourth Pacific Rim Conference on Multimedia, 1702–1706, (2003).
[5]. C. P. Schnorr, “Efficient signature generation for smartcards”, Journal of Cryptology, 4, 161–174, (1991).
[6]. C. Y. Lu, W. C. Yang, C. S. Laih, “Efficient Modular Exponentiation Resistant to Simple Power Analysis in DSA-Like Systems”, International Conference on Broadband, Wireless Computing, Communication and Applications, Fukuoka, 401–406, (2010).
[7]. D. R. Stinson, “Cryptography: Theory and Practice”, CRC Press, (2003).
[8]. NIST, “Special Publication 800-57 Part 1”, (2020).
[9]. GOST R34.10–2012, “Russian Federation Standard Information Technology”, Government Committee of Russia for Standards, (2012).
[10]. H. Morita, J. C. Schuldt, T. Matsuda, G. Hanaoka, T. Iwata, “On the security of the Schnorr signature scheme and DSA against related key attacks”, International Conference on Information Security and Cryptology — CRYPTOLOGY ’15, Springer, 20–35, (2015).
[11]. Luu Hong Dung, Hoang Thi Mai, Nguyen Huu Mong, “A form of digital signature scheme on the problem of number factoring”, Conference FAIR, 377–386, (2015).
[12]. L. Xiao-fei, S. Xuan-jing, C. Hai-peng, “An Improved ElGamal Digital Signature Algorithm Based on Adding a Random Number”, International Conference on Networks Security, Wireless Communications and Trusted Computing, Wuhan, 236–240, (2010).
[13]. M. Toorani, A. Beheshti Shirazi, “SSMS - A secure SMS messaging protocol for the m-payment systems”, IEEE Symposium on Computers and Communications, 700–705, (2008).
[14]. NIST, “Special Publication 800-57 Part 1 Revision 5 Recommendation for Key Management”, (2020).
[15]. Neetesh Saxena, Narendra S. Chaudhari, Jaya Thomas, “Solution to An Attack on Digital Signature in SMS Security”, Department of Computer Science & Engineering Indian Institute of Technology Indore.
[16]. Okamoto E, “Key distribution systems based on identification information”, Proc. of Crypto, (1987).
[17]. R. Crandall, C. Pomerance, “Prime Numbers, A Computational Perspective”, Springer Science, (2005).
[18]. T. S. Ng, S. Y. Tan, J. J. Chin, “A variant of Schnorr signature scheme with tight security reduction”, International Conference on Information and Communication Technology Convergence (ICTC), Jeju Island, Korea, 411–415, (2017).
[19]. W. C. Kuo, “On ElGamal Signature Scheme”, Future Generation Communication and Networking (FGCN), Jeju, 151–153, (2007).
[20]. Tripathi Shailendra Kumar, Bhupendra Gupta, “An efficient digital signature scheme by using integer factorization and discrete logarithm problem”, International Conference on Advances in Computing, Communications and Informatics (ICACCI), IEEE, (2017).
