Smaller public keys for MinRank-based schemes

by   Antonio J. Di Scala, et al.
Politecnico di Torino

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.


Entropoid Based Cryptography

By analogy with the developed cryptographic theory of discrete logarithm...

Protecting Quantum Procrastinators with Signature Lifting: A Case Study in Cryptocurrencies

Current solutions to quantum vulnerabilities of widely used cryptographi...

Improved Veron Identification and Signature Schemes in the Rank Metric

It is notably challenging to design an efficient and secure signature sc...

Signature Correction Attack on Dilithium Signature Scheme

Motivated by the rise of quantum computers, existing public-key cryptosy...

Post-Quantum Key Agreement Protocol based on Non-Square Integer Matrices

We present in this paper an algorithm for exchanging session keys, coupl...

Weak-Key Analysis for BIKE Post-Quantum Key Encapsulation Mechanism

The evolution of quantum computers poses a serious threat to contemporar...

Offline Signature-Based Fuzzy Vault (OSFV: Review and New Results

An offline signature-based fuzzy vault (OSFV) is a bio-cryptographic imp...

Please sign up or login with your details

Forgot password? Click here to reset