arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.00241cs.CR
收藏

基于秩准循环码签名方案的密钥恢复攻击

Key Recovery Attack on Rank Quasi-Cyclic Code-based Signature Scheme

Terry Shue Chien Lau, Chik How Tan

摘要:

秩准循环签名(RQCS)是Song等人在[2]中提出的一种基于秩度量码的签名方案,它基于秩准循环伴随式译码(RQCSD)问题。他们的论文被第22届公钥密码学实践与理论国际会议(PKC 2019)接受。他们还证明了在随机预言机模型中RQCS是EUF-CMA。本文介绍了如何恢复的秘密密钥在RQCS与实际模拟。实验结果表明,在128位、192位和256位安全级别下,我们都能在41秒内恢复出RQCS秘密密钥.

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑