Skip to main content
SpringerLink
Log in

A Proposal of a New Public Key Cryptosystem Using Matrices over a Ring

  • Conference paper
Book cover Information Security and Privacy (ACISP 2000)

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

Included in the following conference series:

Abstract

In this paper, we propose a new public key cryptosystem based on a probably subexponential time problem over a modular matrix ring. Our new cryptosystem is similar to GGH(O. Goldreich, S. Goldwasser, and S. Halevi) cryptosystem but the attack which breaks the GGH system is not applicable to ours. The security of the new construction is based on the computational difficulty of integer factorizations.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ajtai, M., Dwork, C.: A Public-key Cryptosystem with Worst-case/Average-case Equivalence. In: Proc. of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 284–293 (1997)

    Google Scholar 

  2. Goldreich, O., Goldwasser, S., Halevi, S.: Public-key Cryptosystems from Lattice Reduction Problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 112–131. Springer, Heidelberg (1997)

    Google Scholar 

  3. Nguyen, P.: Cryptanalysis for the Goldreich-Goldwasser-Halevi Cryptosystem form Crypto 1997. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 288–304. Springer, Heidelberg (1999)

    Google Scholar 

  4. van Emde Boas, P.: Another NP-complete Problem and the Complexity of Computing Short Vectors in a Lattice. Technical Report 81-04, Mathematische Instituut, University of Amsterdam (1981)

    Google Scholar 

  5. Dinur, I., Kindler, G., Safra, S.: Approximating-CVP to within Almost-Polynomial Factors is NP-hard, Electronic Colloquium on Computational Complexity, Report No. 48 (1998)

    Google Scholar 

  6. Micciancio, D.: On the hardness of the Shortest Vector Problem, Ph. D. Dissertation, Massachusetts Institute of Technology (September 1998)

    Google Scholar 

  7. Schnorr, C.P.: A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithm. Theoretical Computer Science 53, 201–224 (1987)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Information and Security Technologies(CIST), Korea University, Seoul, Korea

    Heajoung Yoo, Seokhie Hong, Sangjin Lee & Jongin Lim

  2. Electronics and Telecommunications Research Institute(ETRI), Korea

    Okyeon Yi

  3. Korea Information Security Agency(KISA), Korea

    Maenghee Sung

Authors
  1. Heajoung Yoo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seokhie Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sangjin Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jongin Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Okyeon Yi
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Maenghee Sung
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Security Research Centre, Queensland University of Technology, GPO Box 2434, 4000, Brisbane, Queensland, Australia

    E. P. Dawson , A. Clark  & Colin Boyd ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yoo, H., Hong, S., Lee, S., Lim, J., Yi, O., Sung, M. (2000). A Proposal of a New Public Key Cryptosystem Using Matrices over a Ring. In: Dawson, E.P., Clark, A., Boyd, C. (eds) Information Security and Privacy. ACISP 2000. Lecture Notes in Computer Science, vol 1841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10718964_4

Download citation

  • DOI: https://doi.org/10.1007/10718964_4

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation