Xiaoxiong Lu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xiaoxiong Lu has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Chengqing Li
School of Computer Science, Xiangtan University, Xiangtan, China
1 shared publication - Guanrong Chen
Department of Electrical Engineering, City University of Hong Kong, Kowloon 999077, Hong Kong SAR, P. R. China
1 shared publication Hegui Zhu
Northeastern University College of Science
1 shared publicationJiangxia Ge
Northeastern University College of Science
1 shared publication- Kai Tan
School of Computer Science, Xiangtan University, Xiangtan, Hunan, China
1 shared publication Wentao Qi
Northeastern University College of Science
1 shared publication
Latest Publications
- 24 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (2) , 1419-1433
Graph Structure of Chebyshev Permutation Polynomials Over Ring ℤp k
Understanding the underlying graph structure of a nonlinear map over a particular domain is essential in evaluating its potential for real applications. In this paper, we investigate the structure of the associated functional graph of Chebyshev permutation polynomials over a ring $\mathbb {Z}_{p^{k}}$ , with p being a prime number greater than three, where every number in the ring is considered as a vertex and the existing mapping relation between two vertices is regarded as a directed edge. Based on some new properties of Chebyshev polynomials and their derivatives, we disclose how the basic structure of the functional graph evolves with respect to parameter k. First, we present a complete and explicit form of the length of a path starting from any given vertex. Then, we show that the functional graph’s strong patterns indicate that the number of cycles of any given length always remains constant as k increases. Moreover, we rigorously prove the rules on the elegant structure of the functional graph and verify them experimentally. Our results could be useful for studying the emergence mechanism of the complexity of a nonlinear map in digital computers and security analysis of its cryptographic applications.
- 24 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (2) , 1419-1433
Graph Structure of Chebyshev Permutation Polynomials Over Ring ℤp k
Understanding the underlying graph structure of a nonlinear map over a particular domain is essential in evaluating its potential for real applications. In this paper, we investigate the structure of the associated functional graph of Chebyshev permutation polynomials over a ring $\mathbb {Z}_{p^{k}}$ , with p being a prime number greater than three, where every number in the ring is considered as a vertex and the existing mapping relation between two vertices is regarded as a directed edge. Based on some new properties of Chebyshev polynomials and their derivatives, we disclose how the basic structure of the functional graph evolves with respect to parameter k. First, we present a complete and explicit form of the length of a path starting from any given vertex. Then, we show that the functional graph’s strong patterns indicate that the number of cycles of any given length always remains constant as k increases. Moreover, we rigorously prove the rules on the elegant structure of the functional graph and verify them experimentally. Our results could be useful for studying the emergence mechanism of the complexity of a nonlinear map in digital computers and security analysis of its cryptographic applications.
- Open Access
- 19 July 2021
- Published by Springer Nature in Research Square
Dynamic Analysis and Cryptographic Application of a Sinusoidal-polynomial Composite Chaotic System
Owning to complex properties of ergodicity, non-periodic ability and sensitivity to initial states, chaotic systems are widely used in cryptography. In this paper, we propose a sinusoidal--polynomial composite chaotic system (SPCCS), and prove that it satisfies Devaney's definition of chaos: the sensitivity to initial conditions, topological transitivity and density of periodic points. The experimental results show that the SPCCS has better unpredictability and more complex chaotic behavior than the classical chaotic maps. Furthermore, we provide a new image encryption algorithm combining pixel segmentation operation, block chaotic matrix confusing operation, and pixel diffusion operation with the SPCCS. Detailed simulation results verify effectiveness of the proposed image encryption algorithm.
- 19 July 2021
- Published by Springer Nature in Research Square
Open AccessDynamic Analysis and Cryptographic Application of a Sinusoidal-polynomial Composite Chaotic System
Owning to complex properties of ergodicity, non-periodic ability and sensitivity to initial states, chaotic systems are widely used in cryptography. In this paper, we propose a sinusoidal--polynomial composite chaotic system (SPCCS), and prove that it satisfies Devaney's definition of chaos: the sensitivity to initial conditions, topological transitivity and density of periodic points. The experimental results show that the SPCCS has better unpredictability and more complex chaotic behavior than the classical chaotic maps. Furthermore, we provide a new image encryption algorithm combining pixel segmentation operation, block chaotic matrix confusing operation, and pixel diffusion operation with the SPCCS. Detailed simulation results verify effectiveness of the proposed image encryption algorithm.