Abstract
Meneghetti, Picozzi, and Tognolini proposed a Hamming-metric code-based digital signature scheme from QC-LDPC codes in [10]. Using quasi cyclic codes enables the scheme to have small key sizes, while the structure of LDPC codes helps to achieve good overall performance. In this paper, we discuss the security of this code-based signature scheme. In particular, we present a partial key recovery attack that uses a statistical method to recover an important part of the secret key. Using a proof-of-concept Sagemath implementation, we are able to recover part of the secret key using as few as 25 signatures in less than 2 minutes for all proposed parameter sets. Furthermore, we follow up this partial key recovery attack by a forgery attack.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aguilar-Melchor, C., et al.: Hamming quasi-cyclic (HQC). Submission to the NIST post quantum standardization process (2017). https://www.pqc-hqc.org/doc/hqc-specification_2021-06-06.pdf
Aragon, N., et al.: BIKE: bit flipping key encapsulation. Submission to the NIST post quantum standardization process (2017). https://bikesuite.org/files/v5.0/BIKE_Spec.2022.10.10.1.pdf
Bernstein, D.J., et al.: Classic McEliece: conservative code-based cryptography. Submission to the NIST post quantum standardization process (2017). https://classic.mceliece.org/mceliece-rationale-20221023.pdf
Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems (corresp.). IEEE Trans. Inf. Theory 24(3), 384–386 (1978). https://doi.org/10.1109/TIT.1978.1055873
Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157–174. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45682-1_10
Cayrel, P.-L., Véron, P., El Yousfi Alaoui, S.M.: A zero-knowledge identification scheme based on the q-ary syndrome decoding problem. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 171–186. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19574-7_12
D’Alconzo, G., Meneghetti, A., Piasenti, P.: Security issues of CFS-like digital signature algorithms. arXiv preprint arXiv:2112.00429 (2021)
Debris-Alazard, T., Sendrier, N., Tillich, J.-P.: Wave: a new family of trapdoor one-way preimage sampleable functions based on codes. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 21–51. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-34578-5_2
Kabatianskii, G., Krouk, E., Smeets, B.: A digital signature scheme based on random error-correcting codes. In: Darnell, M. (ed.) Cryptography and Coding 1997. LNCS, vol. 1355, pp. 161–167. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0024461
Meneghetti, A., Picozzi, C., Tognolini, G.: A post-quantum digital signature scheme from QC-LDPC codes. IACR Cryptology ePrint Archive 2022/1477 (2022). https://eprint.iacr.org/2022/1477
Otmani, A., Tillich, J.-P.: An efficient attack on all concrete KKS proposals. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 98–116. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25405-5_7
Ren, F., Zheng, D., Wang, W.: An efficient code based digital signature algorithm. Int. J. Netw. Secur. 19(6), 1072–1079 (2017). https://doi.org/10.6633/IJNS.201711.19(6).24
Stern, J.: A new identification scheme based on syndrome decoding. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 13–21. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-48329-2_2
Vardy A.: Algorithmic complexity in coding theory and the minimum distance problem. In: STOC 1997, El Paso, TX, pp. 92–109. ACM, New York (1999). https://doi.org/10.1145/258533.258559
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Prabowo, T.F., Tan, C.H. (2023). Attack on a Code-Based Signature Scheme from QC-LDPC Codes. In: El Hajji, S., Mesnager, S., Souidi, E.M. (eds) Codes, Cryptology and Information Security. C2SI 2023. Lecture Notes in Computer Science, vol 13874. Springer, Cham. https://doi.org/10.1007/978-3-031-33017-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-031-33017-9_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-33016-2
Online ISBN: 978-3-031-33017-9
eBook Packages: Computer ScienceComputer Science (R0)