On the construction of secure public parameters for Megrelishvili protocol

In this paper, we investigate the algebraic properties of the public parameters for Megrelishvili protocol. We provide mathematical formulations for optimal conditions of each parameter. We prove that optimal condition for both parameters is attained whenever the minimal polynomial the public matrix is also a primitive polynomial of degree n, where n is the size of the matrix.