S-RFSB算法  

S-RFSB algorithm

作　　者：李梦东[1,2] 蔡坤锦 邵玉芳 Li Mengdong;Cai Kunjin;Shao Yufang(Dept.of Information Security,Beijing Electronic Science&Technology Institute,Beijing 100070,China;College of Communication Engineering,Xidian University,Xi’an 710071,China)

机构地区：[1]北京电子科技学院信息安全系,北京100070 [2]西安电子科技大学通信工程学院,西安710071

出　　处：《计算机应用研究》2018年第1期272-276,共5页Application Research of Computers

基　　金：北京市支持中央高校共建项目--青年英才计划项目;中央高校基本科研业务费专项资金资助课题

摘　　要：杂凑算法是信息安全领域的常用工具之一。现有杂凑算法的压缩函数多是迭代型的,优点是速度快,缺点是难以进行安全性证明。针对已有算法进行了研究,并提出了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.

关 键 词：伴随式译码 Sponge结构 杂凑函数 可证明安全 S-RFSB算法 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]