Về một giải pháp nâng cao độ an toàn cho lược đồ chữ ký số trong vành hữu hạn Zn
DOI:
https://doi.org/10.54654/isj.v8i2.27Tóm tắt
Tóm tắt— Chữ ký số ngày càng được sử dụng rộng rãi và là yêu cầu bắt buộc đối với rất nhiều nền tảng an toàn. Bài báo đề xuất một giải pháp nâng cao độ an toàn cho lược đồ chữ ký số dựa trên bài toán logarit rời rạc trên vành hữu hạn Zn.
Abstract— The digital signature is increasingly widely used, and it is the mandatory requirement for many security platforms. The paper proposes a solution to improve the security of digital signature scheme based on the problem of discrete logarithm on finite ring Zn.
Downloads
References
Phạm Văn Hiệp, Nguyễn Hữu Mộng, Lưu Hồng Dũng, “Một thuật toán chữ ký xây dựng trên tính khó của việc giải đồng thời hai bài toán phân tích số và logarit rời rạc”, Tạp chí KH và CN, Đại học Đà nẵng, 2018.
Lê Văn Tuấn, Bùi Thế Truyền, Lều Đức Tân, “Phát triển lược đồ chữ ký số mới có độ an toàn dựa trên bài toán logarit rời rạc trên vành Z_n”, Tạp chí KHCN Thông tin và Truyền thông, Học viện CNBCVT, 10- 2018.
Vũ Long Vân, Hồ Ngọc Duy, Nguyễn Kim Tuấn, Nguyễn Thị Thu Thủy, “Giải pháp nâng cao độ an toàn cho lược đồ chữ ký số”, SOIS Tp HCM, 12 - 2017.
T. ElGamal, “A public key cryptosystem and signature scheme based on discrete logarithms”, IEEE Transaction on Information Theory, IT-31(4); pp.469-472, 1985.
W. C. Kuo, “On ElGamal Signature Scheme, Future Generation Communication and Networking” (FGCN 2007), Jeju, pp. 151-153.
C. P. Schnorr, “Efficient signaturegeneration for smartcards”,
Journal of Cryptology Vol. 4, pp. 161-174, 1991.
B. Yang, “A DSA-Based and Efficient Scheme for Preventing IP Prefix Hijacking”, International Conference on Management of e-Commerce and e-Government, Shanghai, pp. 87-92, 2014.
J.m.Liu, X.g.Cheng, and X.m.Wang, “Methods to forge elgamal signatures and determine secret key”, in Advanced Information Networking and Applications, AINA 2006 20th International Conferenceon, vol.1.IEEE, pp. 859–862, 2006.
L. Xiao-fei, S. Xuan-jing and C. Hai-peng, “An Improved ElGamal Digital Signature Algorithm Based on Adding a Random Number, Second International Conference on Networks Security, Wireless Communications and Trusted Computing”, Wuhan, Hubei, pp. 236-240, 2010.
C. Y. Lu, W. C. Yang and 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, pp. 401-406, 2010.
H. Zhang, R. Li, L. Li and Y. Dong, “Improved speed Digital Signature Algorithm based on modular inverse,Proceedings of 2013 2nd International Conference on Measurement, Information and Control”, Harbin, pp. 706-710, 2013.
Z. Ping, W. Tao and C. Hao, “Research on L3 Cache Timing Attack against DSA Adopting Square-and-Multiply Algorithm”, Fifth International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC), Qinhuangdao, pp. 1390-1393, 2015.
Lê Văn Tuấn, Bùi Thế Truyền, Lều Đức Tân, “Contructing the digital signature besed on the discrete logaríthmic problem”, The research journal of military science and technology, No 51ª, ISSN 1859 – 1043, pp 44-56,11- 2017.
S. K. Tripathi and B. Gupta, “An efficient digital signature scheme by using integer factorization and discrete logaríthm problem”, International Conference on Advances in Computing, Communications and Informatics (ICACCI), Udupi, pp. 1261-1266, 2017
Chik How Tan, Xun Yi and Chee Kheong Siew, “Signature scheme based on composite discrete logarithm”, Fourth International Conference on Information, Communications and Signal Processing, pp. 1702-1706, 2003.
Lê Văn Tuấn, Bùi Thế Truyền, “Phát triển thuật toán của SHANK giải bài toán logarít rời rạc trên vành Z_n”,Tạp chí Nghiên cứu KH & CNQS số 48, 4- 2017.
Arjen K. Lenstra, Eric R. Verheul, Selecting Cryptographic Key Sizes, Springer-Verlag Berlin Heidelberger, pp. 446-465, 2000.
Downloads
Published
How to Cite
Issue
Section
License
Proposed Policy for Journals That Offer Open Access
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
Proposed Policy for Journals That Offer Delayed Open Access
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication, with the work [SPECIFY PERIOD OF TIME] after publication simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
