Abstract
A digital signature scheme is one of essential cryptographic primitives for secure transactions over open networks. Korean cryptographic community, in association with government-supported agencies, has made a continuous effort over past three years to develop our own signature standard. The outcome of this long effort is the signature algorithm called KCDSA, which is now at the final stage of standardization process and will be published as one of KICS (Korean Information and Communication Standards). This paper describes the proposed signature algorithm and discusses its security and efficiency aspects.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
KCDSA was developed by a task force team consisting of Sang Jae Moon (Kyung Pook Univ.), Dong Ho Won (Sung Gyun Kwan Univ.), Sung Jun Park (KISA), Chung Ryong Jang (Kyung Dong Univ.), Shin Gak Kang (ETRI), Eun Jeong Lee (POSTECH), Sang Bae Park (IDIS), Chul Kim (Kwang Woon Univ.), Kyung Seok Lee (KIET), Jae Hyun Baek (ADD), Jong Tae Shin (KISA), etc., and the present authors, under the financial support of ETRI (Electronics and Telecommunications Research Institute) and KISA (Korea Information Security Agency).
Download to read the full chapter text
Chapter PDF
References
R. Anderson and S. Vaudenay, Minding your p’s and q’s, In Advances in Cryptology-ASIACRYPT’96, LNCS 1163, Springer-Verlag, 1996, pp.15–25.
D. Bleichenbacher, Generating ElGamal signatures without knowing the secret, In Advances in Cryptology-EUROCRYPT’96, LNCS 1070, Springer-Verlag, 1996, pp.10–18.
M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, In Proc. of 1st ACM Conference on Computer and Communications Security, 1993, pp.62–73.
E.F. Brickell, Invited lecture given at Crypto’96, unpublished.
T. Elgamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Inform. Theory, IT-31, 1985, pp.469–472.
Knuth, The Art of Computer Programming, Vol. 2, Addison-Wesley, 1981.
C.H. Lim and P.J. Lee, More flexible exponentiation with precomputation, In Advances in Cryptology-CRYPTO’94, LNCS 839, Springer-Verlag, pp.95–107.
C.H. Lim and P.J. Lee, A key recovery attack on discrete log based schemes using a prime order subgroup, In Advances in Cryptology-CRYPTO’97, LNCS 1294, Springer-Verlag, pp.249–263.
C.H. Lim, H.S. Hwang and P.J. Lee, Fast modular reduction with precomputation, Proc. of 1997 Korea-Japan Joint Workshop on Information Security and Cryptology (JW-ISC’97), Oct. 26–28, 1997, pp.65–79.
M. Michels, D. Naccache and H. Petersen, GOST 34.10-A brief overview of Russia’s DSA, Computers and Security, 15(8), 1996, pp.725–732.
A.M. Odlyzko, The future of integer factorization, CryptoBytes, 1(2), 1995, pp.5–12.
P.C. van Oorschot and M.J. Wiener, On Diffie-Hellman key agreement with short exponents, In Advances in Cryptology-EUROCRYPT’96, LNCS 1070, Springer-Verlag, 1996, pp.332–343.
D. Pointcheval and J. Stern, Security proofs for signature schemes, In Advances in Cryptology-EUROCRYPT’96, LNCS 1070, Springer-Verlag, 1996, pp.387–398.
D. Pointcheval and S. Vaudenay, On provable security for digital signature algorithms, a manuscript, 1996, available from http://www:dmi:ens:fr/~pointche/.
R.L. Rivest / M.E. Hellman / J.C. Anderson, Responses to NIST’s proposal, Comm. ACM, 35(7), 1992, pp.41–52.
R.L. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public key cryptosystems, Commun. ACM, 21(2), 1978, pp.120–126.
J. Stern, The validation of cryptographic algorithms, In Advances in Cryptology-ASIACRYPT’96, LNCS 1163, Springer-Verlag, 1996, pp.301–310.
S. Vaudenay, Hidden collisions on DSS, In Advances in Cryptology-CRYPTO’96, LNCS 1109, Springer-Verlag, 1996, pp.83–88.
NIST, Digital signature standard, FIPS PUB 186, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lim, C.H., Lee, P.J. (2000). A Study on the Proposed Korean Digital Signature Algorithm. In: Ohta, K., Pei, D. (eds) Advances in Cryptology — ASIACRYPT’98. ASIACRYPT 1998. Lecture Notes in Computer Science, vol 1514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49649-1_15
Download citation
DOI: https://doi.org/10.1007/3-540-49649-1_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65109-3
Online ISBN: 978-3-540-49649-6
eBook Packages: Springer Book Archive