一、基本情況
姓名：孫志敏
學位：博士
職稱：教授
研究方向：序列設計、密碼學、編碼學
聯系方式：zmsun@hubu.edu.cn
二、教育背景
2003.9-2006.6 |
中國科學院數學與系統科學研究院 |
應用數學 |
博士 |
2000.9-2003.7 |
華中師範大學 |
基礎數學 |
碩士 |
1996.9-2000.7 |
三峽大學 |
基礎數學 |
學士 |
三、工作經曆
2013.10至今 |
永利 |
副教授 |
2017.5-2018.5 |
奧地利科學院 |
Johann Radon計算與應用數學研究所（訪問學者） |
2010.5-2013.9 |
永利 |
數學與計算機科學學院 |
副教授 |
2006.7-2010.4 |
永利 |
數學與計算機科學學院 |
講師 |
四、主持項目
湖北省科技廳,面上項目,流密碼的密鑰流不可預測性和穩定性研究,2019.09–2021.09
五、論文情況
(1) Zhimin Sun, Xiangyong Zeng, Chunlei Li, Tor Helleseth, Investigations on periodic sequences with maximum nonlinear complexity. IEEE Transactions on Information Theory,63(10)(2017):6188-6198.
(2) Jiarong Peng, Xiangyong Zeng,Zhimin Sun, Finite length sequences with large nonlinear complexity. Advance in Mathematics of Communications,12(1)(2018):215-230.
(3) Zhimin Sun, Arne Winterhof, On the maximum order complexity of the Thue-Morse and Rudin-Shapiro sequence. Uniform Distribution Theory,14(2)(2019):33-42.
(4) Zhimin Sun,Arne Winterhof, On the maximum order complexity of subsequences of the Thue-Morse and Rudin Shapiro sequence along squares. International Journal of Computer Mathematics: Computer Systems Theory, 4(1)(2019):30-36.
(5) Zhimin Sun, Xiangyong Zeng, Da Lin, On the Nth maximum order complexity and the expansion complexity of Rudin-Shapiro-like sequence. Cryptography and Communications,12(2020):415-426.
(6) Zhimin Sun,Xiangyong Zeng, Chunlei Li, Yi Zhang, Lin Yi, The expansion complexity of ultimately periodic sequences over finite fields. IEEE Transactions on Information Theory,67(11)(2021):7550-7560.
(7) Lin Yi, Xiangyong Zeng,Zhimin Sun,On finite length nonbinary sequences with large nonlinear complexity over the residue ring𝑍𝑚. Advances in Mathematics of Communications,15(4)(2021):701-720.
(8) Lin Yi, Xiangyong Zeng,Zhimin Sun,On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period4𝑝𝑛. Advances in Mathematics of Communications, 2021.
