Smaller public keys for MinRank-based schemes
Abstract
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 paper, 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.
Keywords
Cite
@article{arxiv.2302.12447,
title = {Smaller public keys for MinRank-based schemes},
author = {Antonio J. Di Scala and Carlo Sanna},
journal= {arXiv preprint arXiv:2302.12447},
year = {2023}
}