Author:
Nguyen Kim Tuan ,Nguyen Thi Thu Thuy ,Luu Xuan Van ,Luu Hong Dung
Abstract
In this paper, the authors propose a solution to improve the security of the digital signature scheme, this solution is implemented on two levels of digital signature scheme construction. At the first level, the authors propose a new hard problem, different from the hard problems used before, and importantly, this hard problem belongs to the class of hard problems for which there is currently no solution (except by the “brute force attack” method). At the second level, the authors propose a method to construct new digital signature algorithms based on this hard problem.
Publisher
Academy of Military Science and Technology
Reference16 articles.
1. [1]. Nguyen Kim Tuan, Nguyen Vinh Thai, Luu Hong Dung, “A new construction method of digital signature scheme based on the discrete logarithm combining find root problem on the finite field”, Journal of Military Science and Technology - ISSN 1859-1403. (2022). DOI: 10.54939/1859-1043.j.mst.FEE.2022.164-170
2. [2]. ISO/IEC 15946: Information technology – Security techniques – Cryptographic Techniques Based on Elliptic Curves, (1999).
3. [3]. ANSI X9.62. Public Key Cryptography for the Financial Services Industry: Elliptic Cuve Digital Signature Algorithm (ECDSA), (1999).
4. [4]. National Institute of Standards and Technology, NIST FIPS PUB 186-4. Digital Signature Standard, U.S. Department of Commerce, (2013).
5. [5]. GOST R34.10 – 2012, Russian Federation Standard Information Technology. Government Committee of the Russia for Standards, (2012) (in Russian).