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.
Xu et al. (Sat,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: