Skip to main content
SpringerLink
Log in

Efficient Rabin-type Digital Signature Scheme

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Rabin's cryptosystem was proved to be as hard as factorization. However, Rabin's digital signature schemes is probabilistic. This paper shows two efficient Rabin type digital signature schemes, a basic scheme and an improved scheme. Both schemes run much faster than Rabin's scheme. They are deterministic and the size of a signature is much smaller than that of a signature in Rabin's scheme. Furthermore, it is proved that, by applying the technique of Bellare and Rogaway, the proposed scheme is secure against chosen plaintext attack. More precisely, breaking the proposed digital signature scheme by chosen plaintext attack is as hard as factoring N.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. L. Adleman, K. Manders, and G. Miller, On taking roots in finite fields, Proceedings of 18th IEEE symposium on Foundations of Computer Science (1977) pp. 175-178.

  2. M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, Proceedings of 1st ACM Conference on Computer and Communications Security (1993).

  3. M. Bellare and P. Rogaway, The exact security of digital signatures — how to sign with RSA and Rabin, Proc. of Eurocrypt'96, Vol. 1070 of Lecture Notes in Computer Science, Springer Verlag, Berlin (1996) pp. 399-416.

    Google Scholar 

  4. N. Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, Berlin (1987).

    Google Scholar 

  5. K. Kurosawa, T. Itoh, and M. Takeuchi, Public key cryptosystem using a reciprocal number with the same intractability as factoring a large number, CRYPTOLOGIA, Vol.XII,No.4 (1988) pages 225-233. (Also, available from http://tsk-www.ss.titech.ac.jp/~kurosawa/)

    Google Scholar 

  6. M.O. Rabin, Digitalized signatures and public key cryptosystems as intractable as factorization, Technical Report MIT/LCS/TR-212, MIT, Cambridge, MA (1979).

    Google Scholar 

  7. R.L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public key cryptosystems, Communications of the ACM, Vol.21,no.2 (1978) pp. 120-126.

    Google Scholar 

  8. H.C. Williams, A modification of the RSA public-key encryption procedure, IEEE, IT, Vol.IT-26,No.6 (1980) pp. 726-729.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Electronic Engineering, Faculty of Engineering, Tokyo Institute of Technology, 2–12–1 O-okayama, Meguro-ku, Tokyo, 152–8552, Japan

    Kaoru Kurosawa

  2. Department of Computer Engineering, Faculty of Engineering, Himeji Institute of Technology, 2167 Shosha, Himeji, Hyogo, 671-2201, Japan

    Wakaha Ogata

Authors
  1. Kaoru Kurosawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wakaha Ogata
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kurosawa, K., Ogata, W. Efficient Rabin-type Digital Signature Scheme. Designs, Codes and Cryptography 16, 53–64 (1999). https://doi.org/10.1023/A:1008374325369

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008374325369

Search

Navigation