General Construction Method and Proof for a Class of Quadratic Chaotic Mappings
The importance of chaotic systems as the main pseudo-random cryptographic generator of encryption algorithms in the field of communication secrecy cannot be overstated, but in practical applications, researchers often choose to build upon traditional chaotic maps, such as the logistic map, for study...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-07-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/15/2409 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849405839607070720 |
|---|---|
| author | Wenxia Xu Xiangkun Chen Ziwei Zhou Guodong Li Xiaoming Song |
| author_facet | Wenxia Xu Xiangkun Chen Ziwei Zhou Guodong Li Xiaoming Song |
| author_sort | Wenxia Xu |
| collection | DOAJ |
| description | The importance of chaotic systems as the main pseudo-random cryptographic generator of encryption algorithms in the field of communication secrecy cannot be overstated, but in practical applications, researchers often choose to build upon traditional chaotic maps, such as the logistic map, for study and application. This approach provides attackers with more opportunities to compromise the encryption scheme. Therefore, based on previous results, this paper theoretically investigates discrete chaotic mappings in the real domain, constructs a general method for a class of quadratic chaotic mappings, and justifies its existence based on a robust chaos determination theorem for S single-peaked mappings. Based on the theorem, we construct two chaotic map examples and conduct detailed analysis of their Lyapunov exponent spectra and bifurcation diagrams. Subsequently, comparative analysis is performed between the proposed quadratic chaotic maps and the conventional logistic map using the 0–1 test for chaos and SE complexity metrics, validating their enhanced chaotic properties. |
| format | Article |
| id | doaj-art-b08ffae1183145c8859f994b474758ee |
| institution | Kabale University |
| issn | 2227-7390 |
| language | English |
| publishDate | 2025-07-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematics |
| spelling | doaj-art-b08ffae1183145c8859f994b474758ee2025-08-20T03:36:34ZengMDPI AGMathematics2227-73902025-07-011315240910.3390/math13152409General Construction Method and Proof for a Class of Quadratic Chaotic MappingsWenxia Xu0Xiangkun Chen1Ziwei Zhou2Guodong Li3Xiaoming Song4School of Mathematics and Computing Science, Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation, Guilin University of Electronic Technology, Guilin 541002, ChinaSchool of Mathematics and Computing Science, Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation, Guilin University of Electronic Technology, Guilin 541002, ChinaSchool of Mathematics and Data Science, Changji University, Changji 831100, ChinaSchool of Mathematics and Computing Science, Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation, Guilin University of Electronic Technology, Guilin 541002, ChinaSchool of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin 541002, ChinaThe importance of chaotic systems as the main pseudo-random cryptographic generator of encryption algorithms in the field of communication secrecy cannot be overstated, but in practical applications, researchers often choose to build upon traditional chaotic maps, such as the logistic map, for study and application. This approach provides attackers with more opportunities to compromise the encryption scheme. Therefore, based on previous results, this paper theoretically investigates discrete chaotic mappings in the real domain, constructs a general method for a class of quadratic chaotic mappings, and justifies its existence based on a robust chaos determination theorem for S single-peaked mappings. Based on the theorem, we construct two chaotic map examples and conduct detailed analysis of their Lyapunov exponent spectra and bifurcation diagrams. Subsequently, comparative analysis is performed between the proposed quadratic chaotic maps and the conventional logistic map using the 0–1 test for chaos and SE complexity metrics, validating their enhanced chaotic properties.https://www.mdpi.com/2227-7390/13/15/2409robust chaosquadratic mappingS single-peaked mappingschaotic map0–1 testSE complexity metrics |
| spellingShingle | Wenxia Xu Xiangkun Chen Ziwei Zhou Guodong Li Xiaoming Song General Construction Method and Proof for a Class of Quadratic Chaotic Mappings Mathematics robust chaos quadratic mapping S single-peaked mappings chaotic map 0–1 test SE complexity metrics |
| title | General Construction Method and Proof for a Class of Quadratic Chaotic Mappings |
| title_full | General Construction Method and Proof for a Class of Quadratic Chaotic Mappings |
| title_fullStr | General Construction Method and Proof for a Class of Quadratic Chaotic Mappings |
| title_full_unstemmed | General Construction Method and Proof for a Class of Quadratic Chaotic Mappings |
| title_short | General Construction Method and Proof for a Class of Quadratic Chaotic Mappings |
| title_sort | general construction method and proof for a class of quadratic chaotic mappings |
| topic | robust chaos quadratic mapping S single-peaked mappings chaotic map 0–1 test SE complexity metrics |
| url | https://www.mdpi.com/2227-7390/13/15/2409 |
| work_keys_str_mv | AT wenxiaxu generalconstructionmethodandproofforaclassofquadraticchaoticmappings AT xiangkunchen generalconstructionmethodandproofforaclassofquadraticchaoticmappings AT ziweizhou generalconstructionmethodandproofforaclassofquadraticchaoticmappings AT guodongli generalconstructionmethodandproofforaclassofquadraticchaoticmappings AT xiaomingsong generalconstructionmethodandproofforaclassofquadraticchaoticmappings |