Author:
Nguyen Kim Tuan ,Nguyen Vinh Thai ,Luu Hong Dung
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.
Publisher
Academy of Military Science and Technology
Reference11 articles.
1. [1]. W. Diffie & M. Hellman, “New Directions in Cryptography”, IEEE Trans. On Info. Theory, IT-22(6):644-654, (1976).
2. [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).
3. [3]. Mark Stamp, Richard M. Low, “Applicd cryptanalysis: Breaking Ciphers in the Real World”, John Wiley & Sons, Inc., ISBN 978-0-470-1.
4. [4]. B. Arazi, “Integrating a key distribution procedure into the digital signature standard”, Electronics Letters, Vol. 29(11), pp.966-967, (1993).
5. [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).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献