ИСТИНА

The security of modern public key cryptosystems is dened by algorithmic complexity of some number-theoretic and algebraic problems, such as the number factorization problem or discrete logarithm problem in a finite field. Algebraic structures in which these cryptosystems are implemented are usually residue rings, nite elds, and point groups of algebraic curves. In this talk we discuss cryptosystems over nonassociative structures (quasigroups and quasigroup rings) and describe some construction of linearly optimal codes using left ideals in quasigroup rings.