Using LDGM Codes and Sparse Syndromes to Achieve Digital Signatures
This work addresses the problem of efficient digital signatures with small public keys for cryptographic applications, representing an incremental improvement over existing code-based methods.
The paper tackled the problem of achieving efficient code-based digital signatures with small public keys by exploiting sparse syndromes and low-density generator matrix codes, resulting in a scheme that outperforms existing solutions and achieves considerable security levels with very small public keys.
In this paper, we address the problem of achieving efficient code-based digital signatures with small public keys. The solution we propose exploits sparse syndromes and randomly designed low-density generator matrix codes. Based on our evaluations, the proposed scheme is able to outperform existing solutions, permitting to achieve considerable security levels with very small public keys.