Abstract
Electronic digital signature guarantee message integrity. In the present paper we describe existing algorithms for the formation and verification of the electronic digital signatures. Also in the article on the basis of the analysis of modern methods of formation and verification of electronic digital signatures are considered directions of improvement of the electronic digital signatures procedure using a group of points of the elliptic curves with providing the possibility of ensuring the integrity and confidentiality of information. The proposed new method of electronic digital signatures generation and verification is implemented on the Shnorr signature algorithm, that allows to recover data directly from the signature similarly to RSA-like signature systems and the amount of the recovered information will be variable. The main advantages of improvement procedure is the shorter key length with equivalent cryptographic strength, shorter length of the signature itself and reduced the total length of the transmitted data. Thus new secure digital signature scheme minimize time for formation and verification of confidential information witch depending on the used method based on the elliptic curves and adds a privacy service.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
ISO/IEC. ISO/IEC 9796-3:2006, Information technology – Security techniques – Digital signature schemes giving message recovery – Part 3: Discrete logarithm based mechanisms (2006)
NIST, Recommended elliptic curves for federal government use (1999)
NIST SP 800-131A, Transitions: Recommendation for Transitioning the Use of Cryptographic Algorithms and Key Lengths (2011)
SEC 2: Recommended Elliptic Curve Domain Parameters, Standards for Efficient Cryptography Group (2000)
FIPS PUB 186-4 – Digital Signature Standard (2013)
RFC 6979 – Deterministic Usage of the Digital Signature Algorithm (DSA) and Elliptic Curve Digital Signature Algorithm (ECDSA) (2015)
The state standard of Ukraine 4145-2002, Information Technology – Cryptographic protection of information – Digital signature based on elliptical curves. Formation and Verification (2002). (in Ukrainian)
Miyaji, A.: A message recovery signature scheme equivalent to DSA over elliptic curves. In: Kim, K., Matsumoto, T. (eds.) Advances in Cryptology—ASIACRYPT 1996. Lecture Notes in Computer Science, vol. 1163, pp. 1–14. Springer, Heidelberg (1996)
Pintsov, L.A., Vanstone, S.A.: Postal revenue collection in the digital age. In: Frankel, Y. (eds.) Financial Cryptography, FC 2000. Lecture Notes in Computer Science, vol. 1962, pp. 105–120. Springer, Heidelberg (2001)
Zhang, F., Susilo, W., Mu, Y.: Identity-based partial message recovery signatures (or how to shorten ID-based signatures). In: Patrick, A.S., Yung, M. (eds.) Financial Cryptography and Data Security, FC 2005. Lecture Notes in Computer Science, vol. 3570, pp. 45–56. Springer, Heidelberg (2005)
Tso, R., Gu, C., Okamoto, T., Okamoto, E.: Efficient ID-based digital signatures with message recovery. In: Bao, F., Ling, S., Okamoto, T., Wang, H., Xing, C. (eds.) Cryptology and Network Security, CANS 2007. Lecture Notes in Computer Science, vol. 4856, pp. 47–59. Springer, Heidelberg (2007)
Hu, Z., Dychka, I., Onai, M., Zhykin, Y.: Blind payment protocol for payment channel networks. Int. J. Comput. Netw. Inf. Secur. (IJCNIS) 6(11), 22–28 (2019)
István, V.: Construction for searchable encryption with strong security guarantees. Int. J. Comput. Netw. Inf. Secur. (IJCNIS) 5(11), 1–10 (2019)
Goyal, R., Khurana, M.: Cryptographic security using various encryption and decryption method. Int. J. Math. Sci. Comput. (IJMSC) 3(3), 1–11 (2018)
Shukla, R., Bhandari, R.: A novel minimized computational time based encryption and authentication using ECDSA. Int. J. Mod. Educ. Comput. Sci. (IJMECS) 9(5), 19–25 (2013)
Kazmirchuk, S., Anna, I., Sergii, I.: Digital signature authentication scheme with message recovery based on the use of elliptic curves. In: Hu, Z., Petoukhov, S., Dychka, I., He, M. (eds.) ICCSEEA 2019. AISC, vol. 938, pp. 279–288. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-16621-2_26
Vysotska, O., Davydenko, A.: Keystroke pattern authentication of computer systems users as one of the steps of multifactor authentication. In: Hu, Z., Petoukhov, S., Dychka, I., He, M. (eds.) ICCSEEA 2019. AISC, vol. 938, pp. 356–368. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-16621-2_33
Menezes, A.J., Vanstone, S.A., Van Oorschot, P.C.: Handbook of Applied Cryptography. CRC Press, London (1996)
Schneier, B.: Applied Cryptography, 2nd edn. Wiley, Hoboken (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Kazmirchuk, S., Ilyenko, A., Ilyenko, S., Prokopenko, O., Mazur, Y. (2021). The Improvement of Digital Signature Algorithm Based on Elliptic Curve Cryptography. In: Hu, Z., Petoukhov, S., Dychka, I., He, M. (eds) Advances in Computer Science for Engineering and Education III. ICCSEEA 2020. Advances in Intelligent Systems and Computing, vol 1247. Springer, Cham. https://doi.org/10.1007/978-3-030-55506-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-030-55506-1_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-55505-4
Online ISBN: 978-3-030-55506-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)