检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:严迎建[1] 王寿成[1] 徐进辉[1] 李功丽[1,2] YAN Ying-jian;WANG Shou-cheng;XU Jin-hui;LI Gong-li(PLA Information Engineering University,Zhengzhou,He nan 450001,China;College of Computer&Information Engineering,He nan Normal University,Xinxiang,He nan 453002,China)
机构地区:[1]解放军信息工程大学,河南郑州450001 [2]河南师范大学计算机信息工程学院,河南新乡453002
出 处:《北京理工大学学报》2018年第9期977-984,共8页Transactions of Beijing Institute of Technology
基 金:国家自然科学基金资助项目(61404175)
摘 要:为进行分组密码并行处理的理论研究和定量分析,构建了基于Amdahl定律的分组密码并行处理模型.通过引入分组内数据级并行性、分组内指令级并行性、分组间数据级并行性和分组间指令级并行性等并行性,建立了分组密码的多维度并行处理模型,研究了算法参数和并行参数对分组密码处理性能的影响.结果表明,并行比例大的算法其性能提升空间较大,且开发任一并行性都能够提升密码运算性能;但对于具体的应用场景,需要根据算法结构、工作模式等来进行合理的资源配置和并行性开发;该模型能够为分组密码算法的并行处理架构设计、资源配置和并行性开发等提供理论依据和指导原则.In order to carry out the theoretical research and quantitative analysis of block cipher parallel processing,a block cipher parallel processing model based on Amdahl s law was established.Introducing data level parallelism in block,instruction level parallelism in block,data level parallelism among blocks and instruction level parallelism among blocks,a multiple dimension parallel processing model was developed to study the effects of algorithm parameters and parallelism parameters on cipher processing performance.The results show that,the algorithms with large parallel ratio possess a larger performance improvement space,and the development of any parallelism can improve the performance.But resource allocation and parallelism development should be carried on according to the algorithm structure and work modes for the specific application scenarios.This model can be taken as the guidance for the parallel processing architecture design,resource allocation and parallelism development of block cipher.
关 键 词:分组密码 并行处理 多维度并行性 AMDAHL定律 加速比
分 类 号:TP309.7[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.226.163.238