A new construction method of digital signature scheme based on the discrete logarithm combining find root problem on the finite field F_p

152 views

Authors

  • Nguyen Kim Tuan (Corresponding Author) Duy Tan University
  • Nguyen Vinh Thai Academy of Military Science and Technology
  • Luu Hong Dung Military Technical Academy

DOI:

https://doi.org/10.54939/1859-1043.j.mst.FEE.2022.164-170

Keywords:

Discrete logarithm problem (DLP); Digital signature algorithm; Digital signature schemes; Asymmetric - key cryptosystems.

Abstract

The article proposes a method to build a signature scheme based on a new hard problem, called the logarithm problem with roots on the finite field . Now, this is a hard problem belonging to the class of unsolvable problems, except for the “brute force” method. Therefore, building a digital signature scheme based on the difficulty of this problem will most likely allow improving the security of the digital signature algorithm according to the proposed new method. In addition, the method of building signature schema here can be applied to develop a class of signature algorithms suitable for applications with high requirements for security in practice applications.

References

[1]. W. Diffie & M. Hellman, “New Directions in Cryptography”, IEEE Trans. On Info. Theory, IT-22(6):644-654, (1976). DOI: https://doi.org/10.1109/TIT.1976.1055638

[2]. T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms”, IEEE Transactions on Information Theory. Vol. IT-31, No. 4. pp.469-472, (1985). DOI: https://doi.org/10.1109/TIT.1985.1057074

[3]. Mark Stamp, Richard M. Low, “Applicd cryptanalysis: Breaking Ciphers in the Real World”, John Wiley & Sons, Inc., ISBN 978-0-470-1.

[4]. B. Arazi, “Integrating a key distribution procedure into the digital signature standard”, Electronics Letters, Vol. 29(11), pp.966-967, (1993). DOI: https://doi.org/10.1049/el:19930643

[5]. Do Viet Binh, “Authenticated key exchange protocol based on two hard problems”, Tạp chí nghiên cứu khoa học và công nghệ quân sự, số 50, trang 147-152, (2017).

[6]. Đỗ Việt Bình, Nguyễn Hiếu Minh, “Phát triển giao thức trao đổi khóa an toàn dựa trên 2 bài toán khó”, Tạp chí Nghiên cứu KH&CN quân sự, Số Đặc san CNTT, (2018).

[7]. Nguyễn Vĩnh Thái, Lưu Hồng Dũng, “Xây dựng giao thức trao đổi khóa an toàn dựa trên tính khó của việc giải đồng thời hai bài toán logarit rời rạc và phân tích số/khai căn cho các hệ mật khóa đối xứng”, Tạp chí Nghiên cứu KH&CN quân sự, Số Đặc san CNTT, (2019).

[8]. “Cryptography and Network Security: Principles and Practice”, 7th Edition, ISBN 978-0-13-444428-4, by William Stallings 2017.

[9]. https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-56Ar2.pdf.

[10]. National Institute of Standards and Technology, FIPS PUB 186-4, 2013.

[11]. 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).

Downloads

Published

23-12-2022

How to Cite

Nguyen Kim Tuan, Nguyen Vinh Thai, and Luu Hong Dung. “A New Construction Method of Digital Signature Scheme Based on the Discrete Logarithm Combining Find Root Problem on the Finite Field F_p”. Journal of Military Science and Technology, no. FEE, Dec. 2022, pp. 164-70, doi:10.54939/1859-1043.j.mst.FEE.2022.164-170.

Issue

Section

Research Articles

Categories