[1] Lenstra A K, Lenstra H W, JR. Manasse M S, et al. The factorization of the ninth Fermat number[J]. Mathematics of Computation, 1993, 61(203):319-349.
[2] Brent R P. Factorization of the tenth and eleventh Fermat numbers[J]. Mathematics of Computation, 2000, 68(154):627-630.
[3] 贾耿华. 关于费马数的研究[D]. 成都:成都理工大学, 2006.
[4] Klapper A, Goresky M. 2-adic shift registers[C]//Fast Software Encryption. Leuven:Springer, 1994:174-178.
[5] Klapper A, Goresky, M. Feedback shift registers, 2-adic span, and combiners with memory[J]. Journal of Cryptology, 1997, 10(2):111-147.
[6] Tian Tian, Qi Wenfeng. 2-adic complexity of binary m -sequences[J]. IEEE Transactions on Information Theory, 2010, 56(1):450-454.
[7] Klimov A, Shamir A. A new class of invertible mappings[C]//CHES 2002. London:Springer, 2003:470-483.
[8] Klimov A, Shamir A. Cryptographic applications of T-functions[C]//SAC 2003. Ottawa:Springer, 2003:248-261.
[9] Klimov A, Shamir A. New cryptographic primitives based on multiword T functions[C]//FSE 2004. Delhi:Springer, 2004:1-15.
[10] Klimov A. Applications of T-functions in cryptography[D]. Rehovot:Weizmann Institute of Science, 2005.
[11] Kolokotronis N. Cryptographic properties of nonlinear pseudorandom number generators[J]. Designs, Codes and Cryptography, 2008, 46(3):353-363.
[12] Wang Yan, Hu Yupu, Li Shunbo, et al. Linear complexity of sequences produced by single cycle T-function[J]. The Journal of China Universities of Posts and Telecommunications, 2011, 18(4):123-128. |
