Near-Ring

Abstract

There are several public key cryptosystem around that use computational hardness of either conjugacy search problem or the word problem for non-abelian groups. In this paper we use decomposition problem in near-ring to construct a public key cryptosystem and improved the security of key establishment protocol based on the decomposition problem.