Rank Quasi-Cyclic Signature (RQCS) is a rank metric code-based signature scheme based on the Rank Quasi-Cyclic Syndrome Decoding (RQCSD) problem proposed by Song et al. in [2]. Their paper was accepted in the 22nd International Conference on Practice and Theory of Public Key Cryptography (PKC 2019). They have also shown that RQCS is EUF-CMA in the random oracle model. This short paper describes how to recover the secret key in RQCS with practical simulations. Our experimental results show that we are able to recover the secret key of RQCS in less than 41 seconds for all the proposed schemes at 128-bit, 192-bit and 256-bit security level.
翻译:asis-Cyclic Signation(RQCS)是根据Song等人在[2] 中提议的 " assi-Cyclic Committee(RQCS) " (RQCS)问题提出的,其论文在第二十二次公用钥匙加密实践和理论国际会议(PKC 2019)上被接受,还表明 " Quasy-Cyclic Committee " (RQCS)是随机或触角模型中的 " EUF-CMA " 。这份简短的论文描述了如何以实际模拟方式恢复 " rQCS " 中的秘密密钥。我们的实验结果表明,我们能够在不到41秒的时间内收回 " RQCS " 秘密密钥 ",用于所有拟议的128比特、192比特和256比特安全级的安全级计划。