Skip to main content

A New Digital Signature Scheme Based on Factoring and Discrete Logarithms

  • Chapter

Part of the book series: The International Series in Engineering and Computer Science ((SECS,volume 769))

Abstract

In 1994, He and Kiesler proposed a digital signature scheme which was claimed to be based on the factoring problem and the discrete logarithms problem. This paper shows that any attacker can forge the signature of He-Kiesler scheme without solving any hard problem. A new digital signature scheme is proposed, the security of which is based on both factorization problem and discrete logarithms problem.

This work was supported in part by the Natural Science Foundation of China under Grant 60172015 and the Natural Science Foundation of Anhui Province in China under Grant 03042204.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. HARN, L.: Public-key cryptosystem design based on factoring and discrete logarithms, IEE Proc.-Computers and Digital Techniques, 1994, 141,(3), pp. 193–195

    MATH  Google Scholar 

  2. HE, J., and KIESLER, T.: Enhancing the security of ElGamal’s signature scheme, IEE Proc.-Computers and Digital Techniques, 1994, 141,(4), pp. 249–252

    Google Scholar 

  3. HE, W. H.: Digital signature scheme based on factoring and discrete logarithms, Electron. Letters, 2001, 37,(4), pp. 220–222

    Google Scholar 

  4. LEE, N. Y., and HWANG, T.: Modified Harn signature scheme based on factoring and discrete logarithms, IEE Proc.-Computers and Digital Techniques, 1996, 143,(3), pp. 196–198

    Google Scholar 

  5. SHAO, Z.: Signature schemes based on factoring and discrete logarithms, IEE Proc.-Computers and Digital Techniques, 1998, 145,(1), pp. 33–36

    Google Scholar 

  6. LAIH, C. S., and Kuo, W. C.: New signature schemes based on factoring and discrete logarithms, IEICE Trans. Fund, 1997, E80-A,(1), pp. 46–53

    Google Scholar 

  7. HARN, L.: Comment: Enhancing the security of ElGamal’s signature scheme, IEE Proc.-Computers and Digital Techniques, 1995, 142,(5), pp. 376

    MATH  Google Scholar 

  8. LEE, N. Y., and HWANG, T.: The security of He and Kiesler’s signature schemes, IEE Proc.-Computers and Digital Techniques, 1995, 142,(5), pp. 370–372

    Google Scholar 

  9. LI, J., and XIAO, G.: Remarks on new signature scheme based on two hard problems, Electron. Lett., 1998, 34,(25), pp. 2401

    Google Scholar 

  10. LEE, N. Y.: Security of Shao’s signature schemes based on factoring and discrete logarithms, IEE Proc.-Computers and Digital Techniques, 1999, 146,(2), pp. 119–121

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Kluwer Academic Publishers

About this chapter

Cite this chapter

Wei, S. (2004). A New Digital Signature Scheme Based on Factoring and Discrete Logarithms. In: Chen, K. (eds) Progress on Cryptography. The International Series in Engineering and Computer Science, vol 769. Springer, Boston, MA. https://doi.org/10.1007/1-4020-7987-7_14

Download citation

  • DOI: https://doi.org/10.1007/1-4020-7987-7_14

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4020-7986-3

  • Online ISBN: 978-1-4020-7987-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics