| 注册

S-RFSB算法

李梦东 蔡坤锦 邵玉芳

计算机应用研究2018,Vol.35Issue(1):272-276,5.
计算机应用研究2018,Vol.35Issue(1):272-276,5.DOI:10.3969/j.issn.1001-3695.2018.01.058

S-RFSB算法

S-RFSB algorithm

李梦东 1蔡坤锦 2邵玉芳2

作者信息

  • 1. 北京电子科技学院信息安全系,北京100070
  • 2. 西安电子科技大学通信工程学院,西安710071
  • 折叠

摘要

Abstract

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 2b 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算法

Key words

syndrome decoding/Sponge structure/hash function/provable security/S-RFSB algorithm

分类

信息技术与安全科学

引用本文复制引用

李梦东,蔡坤锦,邵玉芳..S-RFSB算法[J].计算机应用研究,2018,35(1):272-276,5.

基金项目

北京市支持中央高校共建项目——青年英才计划项目 ()

中央高校基本科研业务费专项资金资助课题 ()

计算机应用研究

OA北大核心CSCDCSTPCD

1001-3695

访问量0
|
下载量0
段落导航相关论文