S-RFSB算法

S-RFSB algorithm

杂凑算法是信息安全领域的常用工具之一。现有杂凑算法的压缩函数多是迭代型的,优点是速度快,缺点是难以进行安全性证明。针对已有算法进行了研究,并提出了S-RFSB杂凑算法方案。新的方案采用Sponge结构,该结构在运行效率上比传统MD结构高,变换函数设计采用编码理论的困难问题,即伴随式译码问题,变换函数使用矩阵的大小缩小了2~b倍。这种密码方案具有抵抗量子计算攻击、可证明安全性、实现速度较快等优点,而且仅涉及简单的矩阵运算。

Hash algorithm has long been used in information security field.Most of compression functions of existing hash algorithms are the type of iteration.The advantage of this type is with highly algorithmic speed and the disadvantage is that it is difficult to prove its security.Based on the existing algorithm,this paper proposed a hash function S-RFSB.The new scheme adopted Sponge structure,which was more efficient than the traditional MD structure.Transformation function design used coding theory difficult problem,that was syndrome decoding problem,the transformation function using the matrix size reduced 2 b times.The cryptosystem has the resistance against quantum computing,with not only provable security,but also a rapidly implement because it involves only simple matrix operations.