On the error linear complexity profiles of binary sequences of period 2n
暂无分享,去创建一个
Kenneth G. Paterson | Nicholas Kolokotronis | Nicholas Kalouptsidis | Tuvi Etzion | Konstantinos Limniotis
[1] Kaoru Kurosawa,et al. A relationship between linear complexity and kapa-error linear complexity , 2000, IEEE Trans. Inf. Theory.
[2] Nicholas Kolokotronis,et al. Minimum linear span approximation of binary sequences , 2002, IEEE Trans. Inf. Theory.
[3] Cunsheng Ding,et al. The Stability Theory of Stream Ciphers , 1991, Lecture Notes in Computer Science.
[4] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.
[5] Tuvi Etzion,et al. Constructions for perfect maps and pseudorandom arrays , 1988, IEEE Trans. Inf. Theory.
[6] Kenneth G. Paterson,et al. Computing the error linear complexity spectrum of a binary sequence of period 2n , 2003, IEEE Trans. Inf. Theory.
[7] Jianqin Zhou,et al. On the k-error Linear Complexity of Sequences , 2008, CIS.
[8] Mark Stamp,et al. An algorithm for the k-error linear complexity of binary sequences with period 2n , 1993, IEEE Trans. Inf. Theory.
[9] Kenneth G. Paterson. Perfect maps , 1994, IEEE Trans. Inf. Theory.
[10] Cunsheng Ding,et al. Lower Bounds on the Weight Complexities of Cascaded Binary Sequences , 1990, AUSCRYPT.
[11] Richard A. Games,et al. A fast algorithm for determining the complexity of a binary sequence with period 2n , 1983, IEEE Trans. Inf. Theory.
[12] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .