Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 1997: Computing and Combinatorics pp 186–191Cite as

A Rabin-type scheme based on y 2 ≡ x 3 + bx 2 mod n

  • Session 6: Cryptography and Computational Finance
  • Conference paper
  • First Online:

  • 111 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1276))

Abstract

We propose a new Rabin-type scheme, based on y 2 ≡ x 3 + bx 2 mod n, that extends a scheme proposed by Meyer and Müller based on elliptic curves. The new scheme has security also equivalent to factorisation of n, seems easier in implementation and does not depend on probabilistic algorithms.

This work was funded by NSTB-MOE grant number RP 960668/M.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Koyama, Fast RSA-type schemes based on singular cubic curves y 2 + axy ≡ x 3 (mod n), in Advances in Cryptology-Proceedings of Eurocrypt'95, Lecture Notes in Computer Science 921 (Springer-Verlag, 1995), 329–339

    Google Scholar 

  2. K. Koyama, U.M. Maurer, T. Okamoto & S.A. Vanstone, New public-key schemes based on elliptic curves over the ring ℤn, in Advances in Cryptology-Proceedings of Crypto'91, Lecture Notes in Computer Science 576 (Springer-Verlag, 1992), 252–266

    Google Scholar 

  3. H. Kuwakado, K. Koyama & Y. Tsuruoka, A new RSA-type scheme based on singular cubic curves y 2 ≡ x 3 + bx 2 (mod n), IEICE Trans. Fund. E78-A (1995), 27–33

    Google Scholar 

  4. B. Meyer & V. Müller, A public key cryptosystem based on elliptic curves over ℤ/nℤ equivalent to factoring, in Advances in Cryptology-Proceedings of Eurocrypt'96, Lecture Notes in Computer Science 1070 (Springer-Verlag, 1996), 49–59

    Google Scholar 

  5. M. Joye & J.-J. Quisquater, On the cryptosystem of Chua and Ling, UCL Crypto Group Technical Report, CG-1997/4, Apr. 1997

    Google Scholar 

  6. M. Joye & J.-J. Quisquater, Reducing the elliptic curve cryptosystem of Meyer-Müller to the cryptosystem of Rabin-Williams, to appear in Designs, Codes and Cryptography

    Google Scholar 

  7. M.O. Rabin, Digitalized signatures and public-key functions as intractable as factorization, M.I.T. Technical Report, LCS/TR212, 1979

    Google Scholar 

  8. J.H. Silverman, The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics 106, Springer-Verlag, 1986

    Google Scholar 

  9. H.C. Williams, A modification of the RSA public-key encryption procedure, IEEE Transactions on Information Theory IT-26, No. 6 (1980), 726–729.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, National University of Singapore, 119260, Singapore, Republic of Singapore

    Seng Kiat Chua & San Ling

Authors
  1. Seng Kiat Chua
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. San Ling
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tao Jiang D. T. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chua, S.K., Ling, S. (1997). A Rabin-type scheme based on y 2 ≡ x 3 + bx 2 mod n . In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045085

Download citation

  • DOI: https://doi.org/10.1007/BFb0045085

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63357-0

  • Online ISBN: 978-3-540-69522-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation