Smaller public keys for MinRank-based schemes

02/24/2023

∙

by   Antonio J. Di Scala, et al.

∙

0

∙

share

MinRank is an NP-complete problem in linear algebra whose characteristics make it attractive to build post-quantum cryptographic primitives. Currently, three MinRank-based digital signature schemes have been proposed: Curtois' (2001), MR-DSS (2022), and MRitH (2022). Of these, MR-DSS has the smallest public-key size. We propose a key-generation algorithm for MinRank-based schemes that reduces the size of public key to about 50% of that of MR-DSS, putting it in the range of 328-664 bits, for security levels of 128-256 bits.