- E-mailChunlei.Li@uib.no
- Phone+47 55 58 40 13
- Visitor AddressInstitution of Informatics, University of Bergen5020 BergenRoom204N1
- Postal AddressPostboks 78035020 Bergen
My research interests primarily lie in cryptography, coding theory and information security
Selected publications
- 2016. Quasi-perfect linear codes from planar and APN functions. Cryptography and Communications. 8: 215-227. doi: 10.1007/s12095-015-0132-y
- 2015. Some new classes of cyclic codes with three or six weights. Advances in Mathematics of Communications. 9: 23-36. doi: 10.3934/amc.2015.9.23
- 2015. Permutation polynomials of the form (x(pm)-x plus delta)(s)+L(x) over the finite field F-p2m of odd characteristic. Finite Fields and Their Applications. 34: 20-35. doi: 10.1016/j.ffa.2015.01.002
Chinese (Mandarin) is my native language.
I am proficient in both oral and written English.
I am making progress with Norwegian.
Academic article
- (2022). Two New Families of Quadratic APN Functions. IEEE Transactions on Information Theory. 4761-4769.
- (2022). The Differential Spectrum of the Power Mapping x<sup>p</sup>n<sup>-3</sup>. IEEE Transactions on Information Theory. 5535-5547.
- (2022). On the differential properties of the power mapping x^{p^m+2}. Finite Fields and Their Applications. 22 pages.
- (2022). Encoding and decoding of several optimal rank metric codes. Cryptography and Communications. 1281-1300.
- (2021). The Resolution of Niho's Last Conjecture Concerning Sequences, Codes, and Boolean Functions. IEEE Transactions on Information Theory. 6952-6962.
- (2021). On interpolation-based decoding of a class of maximum rank distance codes. IEEE International Symposium on Information Theory. Proceedings. 31-36.
- (2021). Cryptographically strong permutations from the butterfly structure. Designs, Codes and Cryptography. 737-761.
- (2021). Binary Linear Codes With Few Weights From Two-to-One Functions. IEEE Transactions on Information Theory. 4263-4275.
- (2021). Autocorrelations of Vectorial Boolean Functions. Lecture Notes in Computer Science (LNCS). 233-253.
- (2019). Nonsingular Polynomials from Feedback Shift Registers. International Journal of Foundations of Computer Science. 469-487.
- (2018). The linear complexity of generalized cyclotomic binary sequences of period pn. Designs, Codes and Cryptography. 1183-1197.
- (2018). Another generalisation of the binary Reed–Muller codes and its applications. Finite Fields and Their Applications. 144-174.
- (2017). Three-weight ternary linear codes from a family of power functions. Finite Fields and Their Applications. 17-37.
- (2017). New generalized cyclotomic binary sequences of period p2. Designs, Codes and Cryptography. 1-15.
- (2017). Investigations on Periodic Sequences with Maximum Nonlinear Complexity. IEEE Transactions on Information Theory. 6188-6198.
- (2017). An analogue of the ℤ4-Goethals code in non-primitive length. Journal of Systems Science and Complexity. 950-966.
- (2016). Perfect Gaussian integer sequences from cyclic difference sets. IEEE International Symposium on Information Theory. Proceedings. 115-119.
- (2016). Construction of de Bruijn sequences from LFSRs with reducible characteristic polynomials. IEEE Transactions on Information Theory. 610-624.
- (2015). Permutation polynomials of the form (x(pm)-x plus delta)(s)+L(x) over the finite field F-p2m of odd characteristic. Finite Fields and Their Applications. 20-35.
- (2014). Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks. Designs, Codes and Cryptography. 279-305.
- (2014). The weight distributions of several classes of cyclic codes from APN monomials. IEEE Transactions on Information Theory. 4710-4721.
- (2014). The properties of a class of linear FSRs and their applications to the construction of nonlinear FSRs. IEEE Transactions on Information Theory. 3052-3061.
- (2014). Some results on cross-correlation distribution between a p-Ary m-sequence and its decimated sequences. IEEE Transactions on Information Theory. 7368-7381.
- (2014). Optimal ternary cyclic codes with minimum distance four and five. Finite Fields and Their Applications. 100-120.
- (2014). Cross-correlation between a p-ary m-sequence and its all decimated sequences for d = (pm+1)(pm+p-1)/p+1. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 964-969.
- (2014). A class of de Bruijn sequences. IEEE Transactions on Information Theory. 7955-7969.
- (2013). Permutation polynomials with low differential uniformity over finite fields of odd characteristic. Science China Mathematics. 1429-1440.
- (2013). A family of quadriphase sequences of period 4(2 n−1)with low correlation and large linear span. Designs, Codes and Cryptography. 19-35.
- (2012). The lower bound of the second order nonlinearity of a class of Bent functions. Chinese Journal of Computers. 1582-1593.
- (2012). Complementary sequence pairs of types II and III. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 1819-1826.
- (2012). A class of binomial bent functions over the finite fields of odd characteristic. IEEE Transactions on Information Theory. 6054-6063.
- (2011). Evolutionary cryptography against multidimensional linear cryptanalysis. Science in China Series F: Information Sciences. 2565-2577.
- (2011). Capability of evolutionary cryptosystems against differential cryptanalysis. Science in China Series F: Information Sciences. 1991-2000.
- (2010). Design theory and method of multivariate hash function. Science in China Series F: Information Sciences. 1977-1987.
- (2010). A class of binary cyclic codes with five weights. Science in China Series A: Mathematics. 3279-3286.
- (2009). Further properties of several classes of Boolean functions with optimum algebraic immunity. Designs, Codes and Cryptography. 303-338.
Academic lecture
- (2022). Dillon's switching method generalized to c-differentials.
- (2021). Decoding a class of maximum Hermitian rank metric codes.
- (2020). On cryptographic properties of the Welch permutation and a related conjecture.
- (2019). Interpolation-based Decoding of Nonlinear Maximum Rank Distance Codes.
More information in national current research information system (CRIStin)
I am currently with the project Modern Methods and Tools for Theoretical and Applied Cryptology (ITKPLUSS) funded by the Research Council of Norway
Fields of competence