For a prime number p, Bergman (1974) established that End(Z p × Z p 2 ) is a semilocal ring with p 5 elements that cannot be embedded in matrices over any commutative ring. We identify the elements of End(Z p × Z p 2 ) with elements in a new set, denoted by E p , of matrices of size 2 × 2, whose elements in the rst row belong to Z p and the elements in the second row belong to Z p 2 ; also, using the arithmetic in Z p and Z p 2 , we introduce the arithmetic in that ring and prove that the ring End(Z p × Z p 2 ) is isomorphic to the ring E p . Finally, we present a Di e-Hellman key interchange protocol using some polynomial functions over E p de ned by polynomial in Z [X].
Protocols for authenticated key exchange allow parties within an insecure network to establish a common session key which can then be used to secure their future communication. In this paper we introduce a protocol for distributed key agreement over a noncommutative ring with a large number of noninvertible elements. This protocol uses polynomials with coefficients in the center of the ring. We also present the necessary steps for recalculating the shared secret key when a new user joins the system, or when a user leaves the system. Secure communications, key exchange, noncommutative ring, multicast protocol
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.