Smaller public keys for MinRank-based schemes

MinRank is an NP-complete problem in linear algebra whose characteristics make it attractive to build post-quantum cryptographic primitives. Several MinRank-based digital signature schemes have been proposed. In particular, two of them, MIRA and MiRitH, have been submitted to the NIST post-quantum c...

Full description

Saved in:
Bibliographic Details
Published inJournal of mathematical cryptology Vol. 19; no. 1; pp. 572 - 96
Main Authors Di Scala, Antonio J., Sanna, Carlo
Format Journal Article
LanguageEnglish
Published Berlin De Gruyter 14.04.2025
Walter de Gruyter GmbH
Subjects
11T71
15A99
94A60
94A62
Algorithms
Digital signatures
key generation
Linear algebra
MinRank problem
post-quantum cryptography
public key
Quantum cryptography
zero-knowledge proof of knowledge
Online AccessGet full text

Cover

More Information
Summary:MinRank is an NP-complete problem in linear algebra whose characteristics make it attractive to build post-quantum cryptographic primitives. Several MinRank-based digital signature schemes have been proposed. In particular, two of them, MIRA and MiRitH, have been submitted to the NIST post-quantum cryptography standardization process. In this article, we propose a key-generation algorithm for MinRank-based schemes that reduces the size of the public key to about 50% of the size of the public key generated by the previous best (in terms of public-key size) algorithm. Precisely, the size of the public key generated by our algorithm sits in the range of 328–676 bits for security levels of 128–256 bits. We also prove that our algorithm is as secure as the previous ones.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1862-2984
1862-2976
1862-2984
DOI:10.1515/jmc-2024-0008