{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:06:55Z","timestamp":1725494815272},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651093"},{"type":"electronic","value":"9783540496496"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-49649-1_15","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T01:21:12Z","timestamp":1195003272000},"page":"175-186","source":"Crossref","is-referenced-by-count":13,"title":["A Study on the Proposed Korean Digital Signature Algorithm"],"prefix":"10.1007","author":[{"given":"Chae Hoon","family":"Lim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pil Joong","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,24]]},"reference":[{"key":"15_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BFb0034832","volume-title":"Advances in Cryptology-ASIACRYPT\u201996","author":"R. Anderson","year":"1996","unstructured":"R. Anderson and S. Vaudenay, Minding your p\u2019s and q\u2019s, In Advances in Cryptology-ASIACRYPT\u201996, LNCS 1163, Springer-Verlag, 1996, pp.15\u201325."},{"key":"15_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/3-540-68339-9_2","volume-title":"Advances in Cryptology-EUROCRYPT\u201996","author":"D. Bleichenbacher","year":"1996","unstructured":"D. Bleichenbacher, Generating ElGamal signatures without knowing the secret, In Advances in Cryptology-EUROCRYPT\u201996, LNCS 1070, Springer-Verlag, 1996, pp.10\u201318."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"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\u201373.","DOI":"10.1145\/168588.168596"},{"key":"15_CR4","unstructured":"E.F. Brickell, Invited lecture given at Crypto\u201996, unpublished."},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T. Elgamal","year":"1985","unstructured":"T. Elgamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Inform. Theory, IT-31, 1985, pp.469\u2013472.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"15_CR6","unstructured":"Knuth, The Art of Computer Programming, Vol. 2, Addison-Wesley, 1981."},{"key":"15_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-48658-5_11","volume-title":"Advances in Cryptology-CRYPTO\u201994","author":"C.H. Lim","year":"1994","unstructured":"C.H. Lim and P.J. Lee, More flexible exponentiation with precomputation, In Advances in Cryptology-CRYPTO\u201994, LNCS 839, Springer-Verlag, pp.95\u2013107."},{"key":"15_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BFb0052240","volume-title":"Advances in Cryptology-CRYPTO\u201997","author":"C.H. Lim","year":"1997","unstructured":"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\u201997, LNCS 1294, Springer-Verlag, pp.249\u2013263."},{"key":"15_CR9","unstructured":"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\u201997), Oct. 26\u201328, 1997, pp.65\u201379."},{"issue":"8","key":"15_CR10","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/S0167-4048(96)00016-8","volume":"15","author":"M. Michels","year":"1996","unstructured":"M. Michels, D. Naccache and H. Petersen, GOST 34.10-A brief overview of Russia\u2019s DSA, Computers and Security, 15(8), 1996, pp.725\u2013732.","journal-title":"Computers and Security"},{"issue":"2","key":"15_CR11","first-page":"5","volume":"1","author":"A.M. Odlyzko","year":"1995","unstructured":"A.M. Odlyzko, The future of integer factorization, CryptoBytes, 1(2), 1995, pp.5\u201312.","journal-title":"CryptoBytes"},{"key":"15_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-68339-9_29","volume-title":"Advances in Cryptology-EUROCRYPT\u201996","author":"P.C. Oorschot van","year":"1996","unstructured":"P.C. van Oorschot and M.J. Wiener, On Diffie-Hellman key agreement with short exponents, In Advances in Cryptology-EUROCRYPT\u201996, LNCS 1070, Springer-Verlag, 1996, pp.332\u2013343."},{"key":"15_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/3-540-68339-9_33","volume-title":"Advances in Cryptology-EUROCRYPT\u201996","author":"D. Pointcheval","year":"1996","unstructured":"D. Pointcheval and J. Stern, Security proofs for signature schemes, In Advances in Cryptology-EUROCRYPT\u201996, LNCS 1070, Springer-Verlag, 1996, pp.387\u2013398."},{"key":"15_CR14","unstructured":"D. Pointcheval and S. Vaudenay, On provable security for digital signature algorithms, a manuscript, 1996, available from \n                    http:\/\/www:dmi:ens:fr\/~pointche\/\n                    \n                  ."},{"issue":"7","key":"15_CR15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/129902.129905","volume":"35","author":"R.L. Rivest","year":"1992","unstructured":"R.L. Rivest \/ M.E. Hellman \/ J.C. Anderson, Responses to NIST\u2019s proposal, Comm. ACM, 35(7), 1992, pp.41\u201352.","journal-title":"Comm. ACM"},{"issue":"2","key":"15_CR16","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"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\u2013126.","journal-title":"Commun. ACM"},{"key":"15_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BFb0034856","volume-title":"Advances in Cryptology-ASIACRYPT\u201996","author":"J. Stern","year":"1996","unstructured":"J. Stern, The validation of cryptographic algorithms, In Advances in Cryptology-ASIACRYPT\u201996, LNCS 1163, Springer-Verlag, 1996, pp.301\u2013310."},{"key":"15_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/3-540-68697-5_7","volume-title":"Advances in Cryptology-CRYPTO\u201996","author":"S. Vaudenay","year":"1996","unstructured":"S. Vaudenay, Hidden collisions on DSS, In Advances in Cryptology-CRYPTO\u201996, LNCS 1109, Springer-Verlag, 1996, pp.83\u201388."},{"key":"15_CR19","unstructured":"NIST, Digital signature standard, FIPS PUB 186, 1994."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT\u201998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49649-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T12:18:29Z","timestamp":1551097109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49649-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540651093","9783540496496"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-49649-1_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}