一种基于编码的数字签名算法的改进

摘要

为提高基于编码的数字签名算法CFS的效率，利用基于编码的Hash函数对其进行改进。引入一个Hash函数，其输出是一个重量不超过码的纠错能力 t的正则字的校验子，用该函数替换原CFS算法中使用的随机 Hash函数，使签名过程中译码算法只需执行一次，从而避免多次尝试带来的时间消耗。改进算法的签名时间比原始算法缩短了 t！倍，签名效率摆脱了码的纠错能力的限制，且二者的安全性依赖于等价的NP完全问题。%In order to solve the problem of inefficiency of CFS algorithm ,an improved code based digital signature algorithm is proposed by using code based Hash function .The output of this Hash function is a syndrome of a regular word which weight is no more than error correcting ca‐pacity of the code .The substitute of this function for the random Hash function makes the deco‐ding algorithm execute only once in signing phase and avoid the time‐consuming syndrome deco‐ding attempt .The signing time of the improved algorithm can reduce t !times than CFS algorithm and the efficiency can get rid of the restriction from error correcting capacity .Furthermore ,the securities of these two algorithms depend on the equivalent NP complete problems .