The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Cryptosystems with discretized chaotic maps
Abstract
Many kinds of chaotic cryptosystems have been proposed. Chaotic systems dissipate information due to orbital instability with positive Lyapunov exponents and ergodicity. If these properties are appropriately utilized, chaotic cryptosystems are supposed to realize high security. However, most of the existing secure communication techniques using chaos do not have enough security. For example, secure communication protocols based on chaos synchronization require robustness which gives useful information to attackers. The cryptosystems based on direct applications of chaotic maps have been weak against linear and differential cryptoanalysis. In this paper, a new kind of chaotic cryptosystem which overcomes these difficulties to some extent is proposed. The cryptosystem is based on a discretization of the skew tent map. We also show some of the desirable properties of the proposed cryptosystem using dynamical characteristics. These properties regarding ciphertext randomness may be closely related to the cryptological security. Our new cryptosystem uses one step to connect the theory of commonly used cryptosystems and dynamical system theory.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
Symmetric Ciphers Based on Two-Dimensional Chaotic Maps
Fridrich, J. (1998) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812749800098x · Cited by 1,917
Circuit implementation of synchronized chaos with applications to communications
Cuomo, K. M., & Oppenheim, A. V. (1993) · Physical Review Letters · doi:10.1103/physrevlett.71.65 · Cited by 1,729
The art of computer programming. Vol.2: Seminumerical algorithms
Knuth, D. E. (1981) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,232
Synchronization of Lorenz-based chaotic circuits with applications to communications
Cuomo, K. M., Oppenheim, A. V., & Strogatz, S. H. (1993) · IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing · doi:10.1109/82.246163 · Cited by 1,104
Dedieu, H., Kennedy, M. P., & Hasler, M. (1993) · IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing · doi:10.1109/82.246164 · Cited by 829
EXPERIMENTAL DEMONSTRATION OF SECURE COMMUNICATIONS VIA CHAOTIC SYNCHRONIZATION
KOCAREV, L., HALLE, K. S., ECKERT, K., CHUA, L. O., & PARLITZ, U. (1992) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127492000823 · Cited by 760
Extracting Messages Masked by Chaos
Pérez, G., & Cerdeira, H. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.1970 · Cited by 505
Periodic points and measures for Axiom $A$ diffeomorphisms
Bowen, R. (1971) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1971-0282372-0 · Cited by 405
STEPS TOWARD UNMASKING SECURE COMMUNICATIONS
SHORT, K. M. (1994) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812749400068x · Cited by 339
Cited by
SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
ALVAREZ, G., & LI, S. (2006) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127406015970 · Cited by 2,119
Chaos-based cryptography: a brief overview
Kocarev, L. (2001) · IEEE Circuits and Systems Magazine · doi:10.1109/7384.963463 · Cited by 901
A NOVEL FAST IMAGE ENCRYPTION SCHEME BASED ON 3D CHAOTIC BAKER MAPS
MAO, Y., CHEN, G., & LIAN, S. (2004) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812740401151x · Cited by 611
“…applications of bulk data encryption, which make use of two special features of chaotic maps — the sensitivity to initial conditions and parameters and the mixing property (topological transitivity or ergodicity), [Fridrich, 1998; Kocarev, 2001; Kocarev & Jakimovski, 2001; Masuda & Aihara, 2002].”
MethodA symmetric image encryption algorithm based on mixed linear–nonlinear coupled map lattice
Zhang, Y.-Q., & Wang, X.-Y. (2014) · Information Sciences · doi:10.1016/j.ins.2014.02.156 · Cited by 566
An image encryption scheme based on chaotic tent map
Li, C., Luo, G., Qin, K., & Li, C. (2017) · Nonlinear Dynamics · doi:10.1007/s11071-016-3030-8 · Cited by 497
ON THE DYNAMICAL DEGRADATION OF DIGITAL PIECEWISE LINEAR CHAOTIC MAPS
LI, S., CHEN, G., & MOU, X. (2005) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127405014052 · Cited by 433
A block cipher based on a suitable use of the chaotic standard map
Lian, S., Sun, J., & Wang, Z. (2005) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2004.11.096 · Cited by 412
A new image encryption algorithm based on non-adjacent coupled map lattices
Zhang, Y.-Q., & Wang, X.-Y. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2014.09.039 · Cited by 360
Dynamic Analysis of Digital Chaotic Maps via State-Mapping Networks
Li, C., Feng, B., Li, S., Kurths, J., & Chen, G. (2019) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2018.2888688 · Cited by 270
A novel triple-image encryption and hiding algorithm based on chaos, compressive sensing and 3D DCT
Wang, X., Liu, C., & Jiang, D. (2021) · Information Sciences · doi:10.1016/j.ins.2021.06.032 · Cited by 242
CRYPTANALYSIS OF FRIDRICH'S CHAOTIC IMAGE ENCRYPTION
SOLAK, E., ÇOKAL, C., YILDIZ, O. T., & BIYIKOĞLU, T. (2010) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127410026563 · Cited by 215
Security analysis of a chaos-based image encryption algorithm
Lian, S., Sun, J., & Wang, Z. (2005) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2005.01.001 · Cited by 193
A novel plaintext-related image encryption scheme using hyper-chaotic system
Li, Z., Peng, C., Li, L., & Zhu, X. (2018) · Nonlinear Dynamics · doi:10.1007/s11071-018-4426-4 · Cited by 142
A block cipher based on chaotic neural networks
Lian, S. (2009) · Neurocomputing · doi:10.1016/j.neucom.2008.11.005 · Cited by 101
A novel color image encryption scheme using dna permutation based on the lorenz system
Wang, X.-Y., Li, P., Zhang, Y.-Q., Liu, L.-Y., Zhang, H., & Wang, X. (2018) · Multimedia Tools and Applications · doi:10.1007/s11042-017-4534-z · Cited by 92
“Ercan [13] and Chen [3] use chosen plaintext attack method to crack the encryption algorithms [11, 16].”
BackgroundMethodA novel image encryption/decryption scheme based on chaotic neural networks
Bigdeli, N., Farid, Y., & Afshar, K. (2012) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2012.01.007 · Cited by 88
A cryptographic model for better information security
Kumar, S., Kumar, M., Budhiraja, R., Das, M. K., & Singh, S. (2018) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2018.10.011 · Cited by 22
Image Encryption and Chaotic Cellular Neural Network
Peng, J., & Zhang, D. (2009) · Machine Learning in Cyber Trust · doi:10.1007/978-0-387-88735-7_8 · Cited by 9
Metadata
- Authors
- Masuda, N., & Aihara, K.
- Venue
- IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
- Published
- 2002
- Volume
- 49
- Issue
- 1
- Pages
- 28-40
- ISSN
- 1057-7122 (ISSN-L)
- OpenAlex
- W2166934960
- Cited by
- 265
- References
- 27
- FWCI
- 11.23
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.