Encryption system based on abelian groups and rings

S.L. Kryvyi

Abstract


A simple encryption system is based on properties of abelian group an associative and commutative rings with unit is proposed. The algorithms with quadratic time complexity and memory complexity are proposed.  The examples of using such system and the generalization of this system for using of gomofons are considered. To show how to appear the set of gomofons by natural way is used a simple example of massage. Tab. 5. Ref. 3 titles.

Problems in programming 2020; 2-3: 270-277


Keywords


abelian group; ring; encryption system; gomofon; algorithm

Full Text:

PDF (Ukrainian)

References


Kaluznin L.A. Introduction to general algebra. М.: Nauka. 1973. 447 p.

Sergienko I.V., Kryvyi S.L., Provotar O.I. Algebraic aspects of informational technologies. K.:Interservice. 2018. 411 p.

Cooke D.J., Bez H.E. Computer mathematics. Cambridge University Press. Cambridge. 1984. 384 p.

Menezes A., van Oorschot P., Vanstons S. Handbook of Applied Cryptography. CRC Press. 1996. 661 p.

Coblitz N. A course of number theory and cryptography. М.: ТВП. 2001. 260 p.


Refbacks

  • There are currently no refbacks.