Skip to main content

Post-quantum Commutative Encryption Algorithm

  • Conference paper
  • First Online:
Book cover Context-Aware Systems and Applications, and Nature of Computation and Communication (ICCASA 2019, ICTCC 2019)

Abstract

It is considered an extended notion of the commutativity of the encryption. Using the computational difficulty of the hidden discrete logarithm problem, a new method and post-quantum probabilistic algorithm for commutative encryption are proposed. The finite non-commutative associative algebra containing a large set of the global left-sided unites is used as the algebraic carrier of the proposed method and probabilistic commutative cipher. The latter is secure to the known-plaintext attack and, therefore, efficient to implement on its base a post-quantum no-key encryption protocol. Main properties of the algebraic carrier, which are used in the commutative encryption method, are described.

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

Access this chapter

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 EPUB and 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

References

  1. Lange, T., Steinwandt, R. (eds.): PQCrypto 2018. LNCS, vol. 10786. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-79063-3

    Book  Google Scholar 

  2. First NIST Standardization Conference, 11–13 April 2018 (2018). http://prometheuscrypt.gforge.inria.fr/2018-04-18.pqc2018.html

  3. Yan, S.Y.: Quantum Computational Number Theory, p. 252. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25823-2

    Book  MATH  Google Scholar 

  4. Yan, S.Y.: Quantum Attacks on Public-Key Cryptosystems, p. 207. Springer, Cham (2013). https://doi.org/10.1007/978-1-4419-7722-9

    Book  MATH  Google Scholar 

  5. Moldovyan, D.N.: Non-commutative finite groups as primitive of public-key cryptoschemes. Quasigroups Relat. Syst. 18(2), 165–176 (2010)

    MathSciNet  MATH  Google Scholar 

  6. Kuzmin, A.S., Markov, V.T., Mikhalev, A.A., Mikhalev, A.V., Nechaev, A.A.: Cryptographic algorithms on groups and algebras. J. Math. Sci. 223(5), 629–641 (2017)

    Article  MathSciNet  Google Scholar 

  7. Moldovyan, D.N., Moldovyan, N.A.: Cryptoschemes over hidden conjugacy search problem and attacks using homomorphisms. Quasigroups Relat. Syst. 18(2), 177–186 (2010)

    MathSciNet  MATH  Google Scholar 

  8. Hellman, M.E., Pohlig, S.C.: Exponentiation cryptographic apparatus and method. U.S. Patent # 4,424,414. (1984)

    Google Scholar 

  9. Menezes, A.J., Oorschot, P.C., Vanstone, S.A.: Applied Cryptography. CRC Press, New York (1996)

    MATH  Google Scholar 

  10. Nguyen, D.M., Kim, S.: Multi-bits transfer based on the quantum three-stage protocol with quantum error correction codes. Int. J. Theor. Phys. 58(6), 2043–2053 (2019)

    Article  MathSciNet  Google Scholar 

  11. Moldovyan, N.A., Moldovyan, D.N., Le, Q.M., Nguyen, L.G., Ho, S.T., Nguyen, H.M.: Stream pseudo-probabilistic ciphers. In: Cong Vinh, P., Alagar, V. (eds.) ICCASA/ICTCC -2018. LNICST, vol. 266, pp. 36–47. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-06152-4_4

    Chapter  Google Scholar 

  12. Moldovyan, N.A., Moldovyan, A.A., Nguyen, N.H., Tran, M.C., Nguyen, H.M.: Pseudo-probabilistic block ciphers and their randomization. J. Ambient Intell. Hum. Comput. 10(5), 1977–1984 (2019)

    Article  Google Scholar 

Download references

Acknowledgements

The reported study was partially funded by Russian Foundation for Basic Research (project #18-57-54002-Viet_a) and by VietNam Academy of Science and Technology (project # QTRU01.08/18-19).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Minh Hieu Nguyen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Moldovyan, D.N., Moldovyan, A.A., Phieu, H.N., Nguyen, M.H. (2019). Post-quantum Commutative Encryption Algorithm. In: Vinh, P., Rakib, A. (eds) Context-Aware Systems and Applications, and Nature of Computation and Communication. ICCASA ICTCC 2019 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 298. Springer, Cham. https://doi.org/10.1007/978-3-030-34365-1_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-34365-1_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-34364-4

  • Online ISBN: 978-3-030-34365-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics