您的位置:首页  > 论文页面

周期为2n,u2v的二元序列线性复杂度的GPU并行算法

发表时间:2012-04-30  浏览量:1297  下载量:355
全部作者: 杨云鹏,苏明,刘晓光,王刚
作者单位: 南开大学信息技术科学学院
摘 要: 周期为N(2n)的二元序列,其算法的计算过程可以描述为迭代的字节异或运算(exclusive or, XOR),基于统一计算构架(compute unified device architecture, CUDA)计算平台实现部分计算步骤的图形处理器(graphics processing units, GPU)并行化,大幅度提高了线性复杂度的计算效率。实验比较了串行算法、基于机群的并行算法和CUDA算法,结果显示CUDA平台计算效率比其他环境提高了近一个数量级,实验表明CUDA平台适合这类特殊序列的线性复杂度计算。
关 键 词: 数据安全与计算机安全;流密码;周期序列;线性复杂度;Games-Chan算法;统一计算构架
Title: Computation of linear complexity of 2n- and u2v-periodic sequence on CUDA
Author: YANG Yunpeng, SU Ming, LIU Xiaoguang, WANG Gang
Organization: College of Information Technical Science, Nankai University
Abstract: This paper applied the algorithms to some parallel platforms because some parts of calculation can be parallelized, and transformed the computation of the linear complexity into bytes XORs. With several groups of serial, cluster, and compute unified device architecture (CUDA) implementations, the results showed that the CUDA implementation was more efficient compared with others.
Key words: data security and computer security; stream cipher; periodic sequence; linear complexity; Games-Chan algorithm; compute unified device architecture
发表期数: 2012年4月第8期
引用格式: 杨云鹏,苏明,刘晓光,等. 周期为2n,u2v的二元序列线性复杂度的GPU并行算法[J]. 中国科技论文在线精品论文,2012,5(8):730-735.
 
0 评论数 0
暂无评论
友情链接