{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:58:49Z","timestamp":1760597929823,"version":"build-2065373602"},"reference-count":22,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T00:00:00Z","timestamp":1575504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61862042; 61601215"],"award-info":[{"award-number":["61862042; 61601215"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Postgraduate Innovation Project of Jiangxi Province","award":["YC2019S101"],"award-info":[{"award-number":["YC2019S101"]}]},{"name":"Cryptography Theoretical Research of National Cryptography Development Fund","award":["MMJJ20170109"],"award-info":[{"award-number":["MMJJ20170109"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The eigenvalue is one of the important cryptographic complexity measures for sequences. However, the eigenvalue can only evaluate sequences with finite symbols\u2014it is not applicable for real number sequences. Recently, chaos-based cryptography has received widespread attention for its perfect dynamical characteristics. However, dynamical complexity does not completely equate to cryptographic complexity. The security of the chaos-based cryptographic algorithm is not fully guaranteed unless it can be proven or measured by cryptographic standards. Therefore, in this paper, we extended the eigenvalue complexity measure from the finite field to the real number field to make it applicable for the complexity measurement of real number sequences. The probability distribution, expectation, and variance of the eigenvalue of real number sequences are discussed both theoretically and experimentally. With the extension of eigenvalue, we can evaluate the cryptographic complexity of real number sequences, which have a great advantage for cryptographic usage, especially for chaos-based cryptography.<\/jats:p>","DOI":"10.3390\/e21121194","type":"journal-article","created":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T11:16:31Z","timestamp":1575544591000},"page":"1194","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Eigenvalue Complexity of Sequences in the Real Domain"],"prefix":"10.3390","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0298-0191","authenticated-orcid":false,"given":"Lingfeng","family":"Liu","sequence":"first","affiliation":[{"name":"School of Software, Nanchang University, Nanchang 330031, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyue","family":"Xiang","sequence":"additional","affiliation":[{"name":"School of Software, Nanchang University, Nanchang 330031, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renzhi","family":"Li","sequence":"additional","affiliation":[{"name":"School of Software, Nanchang University, Nanchang 330031, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanping","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Automation, Huazhong University of Science &amp; Technique, Wuhan 430074, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,12,5]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Massey, J.L., and Serconek, S. (1994). A Fourier transform approach to the linear complexity of nonlinearly filtered sequences. Annual International Cryptology Conference, Springer.","DOI":"10.1007\/3-540-48658-5_31"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"3047","DOI":"10.1109\/TIT.2003.818400","article-title":"On the linear complexity of nonlinearly filtered PN-sequences","volume":"49","author":"Kolokotronis","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Limniotis, K., Kolokotronis, N., and Kalouptsidis, N. (2006). New results on the linear complexity of binary sequences. 2006 IEEE International Symposium on Information Theory, IEEE.","DOI":"10.1109\/ISIT.2006.261900"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1023\/A:1008295603824","article-title":"An approximate distribution for the maximum order complexity","volume":"10","author":"Erdmann","year":"1997","journal-title":"Des. Codes. Cryptogr."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"4257","DOI":"10.1109\/TIT.2006.880054","article-title":"Constructing periodic binary sequences of maximum nonlinear span","volume":"52","author":"Rizomiliotis","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1840","DOI":"10.1109\/TIT.2005.846428","article-title":"On the quadratic span of binary sequences","volume":"51","author":"Rizomiliotis","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","article-title":"On the complexity of finite sequences","volume":"22","author":"Lempel","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"4293","DOI":"10.1109\/TIT.2007.907442","article-title":"On the nonlinear complexity and Lempel-Ziv complexity of finite length sequences","volume":"53","author":"Limniotis","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1002\/cplx.21587","article-title":"On the Eigenvlaue and Shannon\u2019s Entropy of Finite Length Random Sequences","volume":"21","author":"Liu","year":"2015","journal-title":"Complexity"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1936","DOI":"10.3390\/e17041936","article-title":"On nonlinear complexity and Shannon\u2019s entropy of finite length random sequences","volume":"17","author":"Liu","year":"2015","journal-title":"Entropy"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Tosun, P., Ab\u00e1solo, D., Stenson, G., and Winsky-Sommerer, R. (2017). Characterisation of the effects of sleep deprivation on the electroencephalogram using permutation Lempel-Ziv complexity, a non-linear analysis tool. Entropy, 19.","DOI":"10.3390\/e19120673"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.3934\/amc.2018015","article-title":"Finite length sequences with large nonlinear complexity","volume":"12","author":"Peng","year":"2018","journal-title":"Adv. Math. Commun."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"0600208","DOI":"10.1109\/JSTQE.2012.2219298","article-title":"Fast and tunable all-optical physical random number generator based on direct quantization of chaotic self-pulsations in two-section","volume":"19","author":"Li","year":"2013","journal-title":"IEEE J. Sel. Top. Quantum Electron."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1049\/iet-ipr.2018.5900","article-title":"Novel image encryption algorithm based on improved logistic map","volume":"13","author":"Li","year":"2019","journal-title":"IET Image Process."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"6567198","DOI":"10.1155\/2019\/6567198","article-title":"A new pseudorandom bit generator based on mixing three-dimensional Chen chaotic system with a chaotic tactics","volume":"2019","author":"Huang","year":"2019","journal-title":"Complexity"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2557","DOI":"10.1016\/j.chaos.2007.10.049","article-title":"Logistic chaotic maps for binary numbers generations","volume":"40","author":"Kanso","year":"2009","journal-title":"Chaos Solitons Fract."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1038\/465041a","article-title":"Optoelectronic chaos","volume":"465","author":"Larger","year":"2010","journal-title":"Nature"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Bahi, J.M., Fang, X., Guyeux, C., and Wang, Q. (2011, January 23\u201325). On the design of a family of CI pseudo-random number generators. Proceedings of the 2011 7th International Conference on Wireless Communications, Networking and Mobile Computing, Wuhan, China.","DOI":"10.1109\/wicom.2011.6040161"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/81.974872","article-title":"Cryptosystems with discretized chaotic maps","volume":"49","author":"Masuda","year":"2002","journal-title":"IEEE Trans Circuits Syst. I"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"4297","DOI":"10.1364\/OE.20.004297","article-title":"Direct generation of all-optical random numbers from optical pulse amplitude chaos","volume":"20","author":"Li","year":"2012","journal-title":"Opt. Express"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/7384.963463","article-title":"Chaos-based cryptography: A brief overview","volume":"1","author":"Kocarev","year":"2001","journal-title":"IEEE Circ. Syst. Mag."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1049\/iet-spr.2015.0522","article-title":"N-phase Logistic chaotic sequence and its application for image encryption","volume":"10","author":"Liu","year":"2016","journal-title":"IET Signal Process."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/12\/1194\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:40:28Z","timestamp":1760190028000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/12\/1194"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,5]]},"references-count":22,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2019,12]]}},"alternative-id":["e21121194"],"URL":"https:\/\/doi.org\/10.3390\/e21121194","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2019,12,5]]}}}