Hamming Metric Code-Based Signature Scheme With Restricted Vectors

15 pages•Published: August 21, 2025

Abstract

We introduce HQCS-R, a novel Hamming-metric code-based signature scheme over Z_q. The security of the proposed scheme is based on the hardness of Hamming-metric restricted syndrome decoding problem for quasi cyclic codes, where the error vectors are restricted to a proper subset of Z_q^n. Assuming the hardness of this problem, we prove that HQCS-R is EUF-CMA secure in the classical random oracle model. Furthermore, we thoroughly analyze the security of the scheme, as well as compute a lower bound for the acceptance rate of signature generation. Based on these analyses, we present some concrete parameters for HQCS-R. In particular, for 128-bit security level, the public key and signature sizes of HQCS-R are 5888 bytes and 6265 bytes respectively.

Keyphrases: code based cryptography, hamming metric qc codes, signature

In: Akira Yamada, Huy Kang Kim, Yujue Wang and Tung-Tso Tsai (editors). Proceedings of the 20th Asia Joint Conference on Information Security, vol 106, pages 55-69.

Links:	https://easychair.org/publications/paper/Q3hd
	https://doi.org/10.29007/d743

BibTeX entry

@inproceedings{AsiaJCIS2025:Hamming_Metric_Code_Based,
  author    = {Chik How Tan and Theo Fanuela Prabowo},
  title     = {Hamming Metric Code-Based Signature Scheme With Restricted Vectors},
  booktitle = {Proceedings of the 20th Asia Joint Conference on Information Security},
  editor    = {Akira Yamada and Huy Kang Kim and Yujue Wang and Tung-Tso Tsai},
  series    = {EPiC Series in Computing},
  volume    = {106},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Q3hd},
  doi       = {10.29007/d743},
  pages     = {55-69},
  year      = {2025}}

Download PDF Open PDF in browser