Skip to main content
SpringerLink
Log in

Quasi-inverse Based Cryptography

  • Conference paper
Computational Science and Its Applications – ICCSA 2013 (ICCSA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7974))

Included in the following conference series:

Abstract

We are interested in monoids and its applications. If every element x in a monoid has a quasi-inverse y in the sense of von Neumann, that satisfies x ·y ·x = x and y ·x ·y = y, the monoid is regular. Our purpose is to use regular monoids to build two abstract algebraic public key cryptosystems: key exchange protocol and public key encryption with keyword search scheme. In addition to illustrating how the two cryptosystems work, we provide instances of these abstract algebraic models and analyse them in terms of cryptanalysis security.

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. Diffie, W.: The First Ten of Public Key Cryptography. Proceedings of the IEEE 76(5), 560–577 (1988)

    Article  Google Scholar 

  2. Rivest, R.L., Shamir, A., Adleman, L.M.: Cryptographic Communications System and Method. U.S. Patent #4,405,829 (1983)

    Google Scholar 

  3. Steinberg, B.: A Theory of Transformation Monoids: Combinatorics and Representation Theory. The Electronic Journal of Combinatorics 17 #R164 (2010)

    Google Scholar 

  4. Waters, B., Balfanz, D., Durfee, G., Smetters, D.: Building an Encrypted and Searchable Audit Log. In: The 11th Annual Network and Distributed System Security Symposium, NDSS 2004, San Diego, California (2004)

    Google Scholar 

  5. Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public Key Encryption with Keyword Search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Campell, S.L., Meyer, C.D.: Generalized Inverse of Linear Transformations. Dover Publications, New York (1979)

    Google Scholar 

  7. Menezes, A.J., Oorschot, P.C.V., Vanstone, S.A.: Handbook of Applied Cryptography, p. 33. CRC Press (1997)

    Google Scholar 

  8. ANSI X9.30 (PART 2), American National Standard for Financial Services - Public key cryptography using irreversible algorithms for the financial services industry - Part 2: The secure hash algorithm (SHA), ASC X9 Secretariat - American Bankers Association (1993)

    Google Scholar 

  9. Rivest, R.: The MD5 Message-Digest Algorithm. RFC 1321 (1992)

    Google Scholar 

  10. Gorenstein, D.: The Classification of Finite Simple Groups Vol. 1. Groups of Noncharacteristic 2 Type. The University Series in Mathematics. Plenum Press (1983) ISBN 978-0-306-41305-6, MR 746470

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Science, Ho Chi Minh City, Vietnam

    Thuc Dinh Nguyen & Van H. Dang

Authors
  1. Thuc Dinh Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Van H. Dang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. L-I.S.U.T. - D.A.P.I.t. Facoltà Ingegneria, Università degli Studi della Basilicata, Viale dell’Ateneo Lucano, 10, 85100, Potenza, Italy

    Beniamino Murgante

  2. Canaanland OTA, Covenant University, Nigeria

    Sanjay Misra

  3. Partimento di Scienze e Tecnologie per LAgricoltura, le Foreste, la Natura e lEnergia, Università degli Studi della Tuscia, Via S. Camillo de Lellis, snc, 01100, Viterbo, Italy

    Maurizio Carlini

  4. Dipartimento di Scienze dell’Ingegneria Civile e dell’Architecttura, Politecnico di Bari, Via Orabona, 4, 70125, Bari, Italy

    Carmelo M. Torre

  5. Quarter 6, Linh Trung, Thu Duc, International University VNU-HCM, Ho Chi Minh City, Vietnam

    Hong-Quang Nguyen

  6. School of Business Systems, Monash University, 3800, Clayton, VIC, Australia

    David Taniar

  7. Department of Intelligent Informatics, Kyushu Sangyo University, 2-3-1 Matsukadai, 813-8503, Higashi-ku, Fukuoka, Japan

    Bernady O. Apduhan

  8. Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli, 1, 06123, Perugia, Italy

    Osvaldo Gervasi

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nguyen, T.D., Dang, V.H. (2013). Quasi-inverse Based Cryptography. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2013. ICCSA 2013. Lecture Notes in Computer Science, vol 7974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39649-6_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39649-6_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39648-9

  • Online ISBN: 978-3-642-39649-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation