The Discrete Logarithm Problem in the Group of Non-Singular Circulant Matrices

Menezes and Wu claim that working with the discrete logarithm problem in matrices offers no major improvement from working with a finite field. Many authors, including myself, repeated that claim. It is now a common knowledge that for practical purposes, the discrete logarithm problem in non-singular matrices is not worth looking at. In this paper, the author provide a counterexample to the above mentioned common knowledge and show that matrices can be used effectively to produce a fast and secure cryptosystem.