基于格基约化算法的环上截位序列还原  

Reconstructing Truncated Sequences Derived from Primitive Sequences over Integer Residue Rings Based on Lattice Basis Reduction Algorithm

作　　者：杨建斌 朱宣勇 

机构地区：[1]数学与先进计算国家重点实验室,河南郑州450001

出　　处：《信息工程大学学报》2017年第4期442-447,共6页Journal of Information Engineering University

基　　金：国家自然科学基金资助项目(61170235)

摘　　要：研究由序列a-的最低l比特序列还原整体序列的问题。将该问题转化为使用格基约化算法求解线性同余方程组的问题。实验结果表明,对ZUC密码算法的驱动序列,即对于■/(2^(31)-1)上的16阶本原序列,当已知整体序列的最低8比特序列,长度为110拍,则可以还原整体序列。In this paper,we study how to recover the original sequences a-from its l least significant bits.This problem can be reduced to the problem of systems of linear congruence,and can be solved by lattice basis reduction algorithm.Moreover,the correctness of the above reconstruction has been validated in experiment.We have successfully reconstructed the primitive sequences of order 16 over ■/(2^(31)-1) of the ZUC algorithm by 110 elements of its 8 least significant bits.

关 键 词：线性递归序列$整数剩余类环 截位序列$序列还原 格基约化算法 

分 类 号：TN918.1[电子电信—通信与信息系统]