The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function
暂无分享,去创建一个
[1] Adi Shamir,et al. A New Class of Invertible Mappings , 2002, CHES.
[2] Caroline Fontaine,et al. Cryptanalysis of a Particular Case of Klimov-Shamir Pseudo-Random Generator , 2004, SETA.
[3] Tor Helleseth,et al. Alinear weakness in the Klimov-Shamir T-function , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[4] Kaoru Kurosawa,et al. A relationship between linear complexity and kapa-error linear complexity , 2000, IEEE Trans. Inf. Theory.
[5] Wilfried Meidl. On the Stability of -Periodic Binary Sequences , 2005 .
[6] Mark Stamp,et al. An algorithm for the k-error linear complexity of binary sequences with period 2n , 1993, IEEE Trans. Inf. Theory.
[7] Adi Shamir,et al. New Cryptographic Primitives Based on Multiword T-Functions , 2004, FSE.
[8] Kaoru Kurosawa,et al. A Relationship Between Linear Complexity and-Error Linear Complexity , 2022 .
[9] Cunsheng Ding,et al. The Stability Theory of Stream Ciphers , 1991, Lecture Notes in Computer Science.
[10] Richard A. Games,et al. A fast algorithm for determining the complexity of a binary sequence with period 2n , 1983, IEEE Trans. Inf. Theory.
[11] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.
[12] Dong Hoon Lee,et al. A New Class of Single Cycle T-Functions , 2005, FSE.
[13] Wilfried Meidl. On the stability of 2/sup n/-periodic binary sequences , 2005, IEEE Transactions on Information Theory.
[14] Adi Shamir,et al. Cryptographic Applications of T-Functions , 2003, Selected Areas in Cryptography.