Skip to main content
Log in

Symmetric Information Exchange System Based on Ring Isomorphism

  • CYBERNETICS
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Algorithms for exchanging messages between subscribers are proposed based on the properties of finite associative-commutative rings with unity and Diophantine equations over such rings. Algorithms for constructing finite rings whose additive groups are full-cycle, and algorithms for constructing isomorphisms between a ring of kth order whose additive group is full-cycle and the residue ring Zk modulo k are presented.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. S. L. Kryvyi, “A cryptosystem based on Abelian groups and rings,” Problemy Programmir., No. 2–3, 270–277 (2020).

    Article  Google Scholar 

  2. S. L. Kryvyi, “Application of commutative rings with unity for construction of symmetric encryption system,” Cybern. Syst. Analysis, Vol. 58, No. 3, 319–330 (2022). https://doi.org/10.1007/s10559-022-00464-z.

    Article  MathSciNet  Google Scholar 

  3. A. I. Kostrykin, An Introduction to Algebra [in Russian], Nauka, Moscow (1977).

    Google Scholar 

  4. A. A. Bukhshtab, Number Theory [in Russian], Prosveshchenie, Moscow (1966).

    MATH  Google Scholar 

  5. W. Lipski, Combinatorics for Programmers [in Polish], Polish Sci. Publ. (PWN), Warsaw (1982).

  6. N. Koblitz, A Course in Number Theory and Cryptography (Graduate Texts in Mathematics, 114), Springer (1994).

  7. S. L. Kryvyi, “Algorithms for solution of systems of linear Diophantine equations in residue fieds,” Cybern. Syst. Analysis, Vol. 43, No. 2, 171–178 (2007). https://doi.org/10.1007/s10559-007-0036-8.

    Article  MathSciNet  MATH  Google Scholar 

  8. S. L. Kryvyi, “Algorithms for solving systems of linear Diophantine equations in residue rings,” Cybern. Syst. Analysis, Vol. 43, No. 6, 787–798 (2007). https://doi.org/10.1007/s10559-007-0103-1.

    Article  MathSciNet  MATH  Google Scholar 

  9. V. N. Opanasenko and S. L. Kryvyi, “Synthesis of neural-like networks on the basis of conversion of cyclic Hamming codes,” Cybern. Syst. Analysis, Vol. 53, No. 4, 627–635 (2017). https://doi.org/10.1007/s10559-017-9965-z.

    Article  MATH  Google Scholar 

  10. Wenbo Mao, Modern Cryptography: Theory and Practice, Prentice Hall (2003).

    Google Scholar 

  11. P. A. Kameswari, S. S. Sriniasarao, and A. Belay, “An application of linear Diophantine equations to cryptography,” Adv. Math.: Sci. J., Vol. 10, 2799–2806 (2021).

    Google Scholar 

  12. A. Berczes, H. Lajos, N. Hirete-Kohno, and T. Kovacs, “A key exchange protocol based on Diophantine equations and S-integers,” JSIAM Letters, 85–88 (2014).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. L. Kryvyi.

Additional information

Translated from Kibernetyka ta Systemnyi Analiz, No. 5, September–October, 2022, pp. 3–15.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kryvyi, S.L., Opanasenko, V.N., Grinenko, E.A. et al. Symmetric Information Exchange System Based on Ring Isomorphism. Cybern Syst Anal 58, 671–682 (2022). https://doi.org/10.1007/s10559-022-00500-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-022-00500-y

Keywords

Navigation