Using LDGM Codes and Sparse Syndromes to Achieve Digital Signatures
classification
💻 cs.CR
cs.ITmath.IT
keywords
achievecodesdigitalkeyspublicsignaturessmallsparse
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.