A study on the proposed korean digital signatur algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1514, Issue , 1998, Pages 175-186

  Lim, Chae Hoon ^a   Lee, Pil Joong ^b  

^a Future Systems Inc   (South Korea)

^b Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTHENTICATION; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; SECURITY OF DATA;

CRYPTOGRAPHIC COMMUNITY; CRYPTOGRAPHIC PRIMITIVES; DIGITAL SIGNATURE SCHEMES; INFORMATION AND COMMUNICATION; OPEN NETWORK; SECURE TRANSACTIONS; SIGNATURE ALGORITHMS; STANDARDIZATION PROCESS;

CRYPTOGRAPHY;

EID: 33745599342     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (19)

1. 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.
2. D. Bleichenbacher, Generating ElGamal signatures without knowing the secret, In Advances in Cryptology - EUROCRYPT'96, LNCS 1070, Springer-Verlag, 1996, pp.10-18.
3. 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.
4. E. F. Brickell, Invited lecture given at Crypto'96, unpublished.
5. T. Elgamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Inform. Theory, IT-31, 1985, pp.469-472.
6. Knuth, The Art of Computer Programming, Vol. 2, Addison-Wesley, 1981.
7. 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.
8. 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.
9. 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.
10. 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.
11. A. M. Odlyzko, The future of integer factorization, CryptoBytes, 1(2), 1995, pp.5-12.
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.
13. D. Pointcheval and J. Stern, Security proofs for signature schemes, In Advances in Cryptology - EUROCRYPT'96, LNCS 1070, Springer-Verlag, 1996, pp.387-398.
14. D. Pointcheval and S. Vaudenay, On provable security for digital signature algorithms, a manuscript, 1996, available from http: f/www.dmi.ens.fr/'pointche/.
15. R. L. Rivest/M. E. Hellman/J. C. Anderson, Responses to NIST's proposal, Comm.ACM, 35(7), 1992, pp.41-52.
16. 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.
17. J. Stern, The validation of cryptographic algorithms, In Advances in Cryptology -ASIACRYPT 96, LNCS 1163, Springer-Verlag, 1996, pp.301-310.
18. S. Vaudenay, Hidden collisions on DSS, In Advances in Cryptology - CRYPTO 96, LNCS 1109, Springer-Verlag, 1996, pp.83-88.
19. NIST, Digital signature standard, FIPS PUB 186, 1994.