Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
复制标题
通过格基约简求解多序列的 FCSR 综合问题
DOI:
10.1007/s10623-017-0375-z
复制
发表时间:
2017-06
期刊:
影响因子:
--
通讯作者:
Zhixiong Chen
中科院分区:
文献类型:
--
作者:
Weihua Liu;Andrew Klapper;Zhixiong Chen
Register synthesis for multi-sequences has significance for the security of word-oriented stream ciphers. Feedback with carry shift registers (FCSRs) are promising alternatives to linear feedback shift registers for the design of stream ciphers. In this paper, we solve the FCSR synthesis problem for multi-sequences by two rational approximation algorithms using lattice theory. One is based on the lattice reduction greedy algorithm proposed by Nguyen and Stehlé (ACM Trans Algorithms (TALG) 5(4):46, 2009). The other is based on the LLL algorithm which is a polynomial time lattice reduction algorithm. Both of these rational approximation algorithms can find the smallest common FCSR for a given multi-sequence but with different numbers of known terms. When the number of sequences within the multi-sequence is less than or equal to 3, the former is suggested because it has better time complexity and fewer terms are needed. Otherwise, the latter will have better time complexity.
登录
查看更多内容
DOI:
10.1007/3-540-44750-4_21
发表时间:
1995-08
期刊:
Journal of Lviv Polytechnic National University. Series of Economics and Management Issues
影响因子:
--
作者:
A. Klapper;M. Goresky
通讯作者:
A. Klapper;M. Goresky
DOI:
10.1007/bf02714735
发表时间:
2001-10
期刊:
Science in China Series : Information Sciences
影响因子:
--
作者:
Liping Wang;Yue-fei Zhu
通讯作者:
Liping Wang;Yue-fei Zhu
DOI:
10.1023/b:desi.0000015886.71135.e1
发表时间:
2004-03
期刊:
Designs, Codes and Cryptography
影响因子:
--
作者:
A. Klapper;Jinzhong Xu
通讯作者:
A. Klapper;Jinzhong Xu
DOI:
10.1145/276698.276705
发表时间:
1998-05
期刊:
--
影响因子:
--
作者:
M. Ajtai
通讯作者:
M. Ajtai
DOI:
10.1051/ita/2012011
发表时间:
2012-07
期刊:
RAIRO Theor. Informatics Appl.
影响因子:
--
作者:
Lu Zhao;Qiao-yan Wen
通讯作者:
Lu Zhao;Qiao-yan Wen