Size-efficient digital signatures with appendix by truncating unnecessarily long hashcode

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Digital signature mechanism with appendix(DSwA) is a type of digital signature in which, after the message, a signature Σ is appended. When DSwA is constructed based on the discrete logarithm problem, Σ is composed of a pair (R, S). When R is a hashcode with bit length γ and S is an element of subgroup of order q with bit length β, it is recommended to adjust γ and β to be similar because the security strength depends on the smaller value between γ and β. However in some circumstances only hash functions with longer output could be available. Then γ becomes unnecessarily longer than β, and hence the longer Σ is appended. For the above case, we propose a generalized method for reducing the size of Σ by truncating R by β without loss of any se- curity strength. Our proposed method can be applied to mechanisms like KCDSA, SDSA, EC-KCDSA, and EC-SDSA in ISO/IEC 14888-3: Digital signatures with appendix - Part 3: Discrete logarithm based mechanisms.

Cite

CITATION STYLE

APA

Lee, J., & Lee, P. J. (2014). Size-efficient digital signatures with appendix by truncating unnecessarily long hashcode. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8893, pp. 69–78). Springer Verlag. https://doi.org/10.1007/978-3-319-14054-4_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free