On a Digital Signature Based on Matrix Decomposition and the MinRank Problem

The following article attempts to define a new digital signature scheme based on a variant of the MinRank problem under appropriate parameters. First, the key generation process will be defined, followed by the message signing and verification processes. The speed of signing and verification will be analyzed, and finally, the signature will be evaluated in terms of security and robustness against known attacks, which will lead to a set of requirements that we will consider when selecting certain parameters related to the size and number of variables. It should be noted that this signature, although simple in design, can serve as the foundation for an entire family of digital signatures based on the central idea that inspired its creation.