gave an algorithm for public key cryptography using simple multiplication of matrices over a given commutative ring and transformed to the cryptography problem to the matrix equation AGB = P in circulant matrices A,B has infinitely many solutions found and obtained a condition for existence of the solution in terms of G namely that the determinant of the doubly circulant coeffiient matrix G is zero .