Author:
Liu Weihua,Klapper Andrew,Chen Zhixiong
Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference18 articles.
1. Ajtai M.: The shortest vector problem in $$ L^2$$ is NP-hard for randomized reductions. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing STOC 98, pp. 10–19. ACM, New York (1998)
2. Arnault F., Berger T.P., Necer A.: Feedback with carry shift registers synthesis with the Euclidean algorithm. IEEE Trans. Inf. Theory 50(5), 910–917 (2004).
3. Dwork C.: Lattices and their application to cryptography. Stanford University, Lecture Notes (1998).
4. Feng G., Tzeng K.: A generalized Euclidean algorithm for multisequence shift-register synthesis. IEEE Trans. Inf. Theory 35(3), 584–594 (1989).
5. Goresky M., Klapper A.: Algebraic Shift Register Sequences. Cambridge University Press, Cambridge (2012).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献