Paper 2019/053

A New Code-based Signature Scheme with Shorter Public Key

Yongcheng Song, Xinyi Huang, Yi Mu, and Wei Wu


Code-based signature has been believed to be a useful authentication tool for post-quantum cryptography. There have been some attempts to construct efficient code-based signatures; however, existing code-based signature schemes suffer from large public-key size, which has affected their applicability. It has been a challenging research task to construct efficient code-based signatures with a shorter public-key size. In this paper, we propose an efficient code-based signature scheme, which offers a short public key size. Our scheme is an analogue to the Schnorr signature where we utilize random rank double circulant codes and matrix-vector product used in the Rank Quasi-Cyclic (RQC) scheme introduced by Melchor et al. (NIST 2017).We provide the security proof of our signature scheme by reducing it to the Rank Quasi-Cyclic Syndrome Decoding (RQCSD) problem. Our work provides an example for the construction of code-based signatures for the applications which require short public keys.

Available format(s)
-- withdrawn --
Cryptographic protocols
Publication info
A minor revision of an IACR publication in PKC 2019
Post-Quantum CryptographyRank Metric CodesDigital Signatures
Contact author(s)
yongchengsong @ outlook com
xyhuang81 @ gmail com
ymu ieee @ gmail com
ispec2014 @ qq com
2019-02-26: withdrawn
2019-01-25: received
See all versions
Short URL
Creative Commons Attribution
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.