PreprintCC BY-SA 4.0arXiv
On a Digital Signature Based on Matrix Decomposition and the MinRank Problem
Abstract
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.
Related
- On the relations among algebraic models for the MinRank problem
- Breaking ACDGV MinRank Gabidulin encryption schemes over matrix codes
- Benign Overfitting Property of the Minimum ℓq -norm Interpolant Estimator in Regression Problem via Feature Space Decomposition
- Hybrid-Dimensional Biot Problem with an Optimization Based Domain Decomposition Approach
- High-Fidelity Digital Twin Data Models by Randomized Dynamic Mode Decomposition and Deep Learning with Applications in Fluid Dynamics
BibTeX
@misc{lopez2026digital,
title = {{On a Digital Signature Based on Matrix Decomposition and the MinRank Problem}},
author = {Miguel Ángel López},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.09140},
eprint = {2610.09140},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.09140},
note = {CC BY-SA 4.0},
}
RIS
TY - UNPB
TI - On a Digital Signature Based on Matrix Decomposition and the MinRank Problem
AU - Miguel Ángel López
PY - 2026
DA - 2026/10/19
PB - arXiv
DO - 10.48550/arxiv.2610.09140
UR - https://arxiv.org/abs/2610.09140
AB - 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.
ER -